|
|
|
| No such thing as a small change | |
| PerlMonks |
Re: Re: An informal introduction to O(N) notationby dws (Chancellor) |
| on Jan 18, 2003 at 17:40 UTC ( #228001=note: print w/ replies, xml ) | Need Help?? |
|
It should be noted that many algorithm's O time can be reduced. You may be getting "best case" and "worst case" mixed up. Clever short-circuits in implementations of algorithms often increase the best case, but only if the data behaves certain ways. There are usually mixes of data that defeat the short-cuts. O() is about worst-case behavior.
In Section
Meditations
|
|
||||||||||||||||||||