From: Matthew Kerwin <lists@...>
Date: 2013-03-19T19:27:09+09:00
Subject: Re: Algorithmic complexity

Matthew Kerwin wrote in post #1102250:
> between O(1) and O(n), I guess the ?? line runs in about map*(each+hash)
> = O(n*m), which is just a bigger O(n).

Er, actually, I think that's O(n²).  Or something.  Argh, undergrad CS
was soo long ago!

-- 
Posted via http://www.ruby-forum.com/.