go ahead... be a heretic | |
PerlMonks |
Re: An informal introduction to O(N) notationby BUU (Prior) |
on Jan 18, 2003 at 05:26 UTC ( [id://227926]=note: print w/replies, xml ) | Need Help?? |
O(N2) says that the algorithm's performance is proportional to the square of the data set size. This happens when the algorithm processes each element of a set, and that processing requires another pass through the set. The infamous Bubble Sort is O(N2). Shouldn't bubble sort be O(NN) as you might have to process the entire thing once for each element, if it was sorted backwords for example?
In Section
Meditations
|
|