The stupid question is the question not asked  
PerlMonks 
comment on 
( #3333=superdoc: print w/replies, xml )  Need Help?? 
Nitpicking: 'Ο' is used for an estimate in excess (it's supposed to be a capital omicron, not an 'oh') 'Ω' is used for an estimate in defect (omega "is bigger" than omicron) 'Θ' is used for the actual growth. For example: mergesort is Ω(1), Ο(n^{2}), Θ(n log n) This is important since it's quite common to know boundaries on the complexity, but not the exact complexity. For example, matrix multiplication is Ω(n^{2}) (you have to generate all the elements), and surely Ο(n^{3}) (there is a naif algorithm with that complexity), but we don't know the exact function.  dakkar  Mobilis in mobile In reply to Re: Re: An informal introduction to O(N) notation
by dakkar

