note
BUU
<hr>
<i>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(N<sup>2</sup>).</i>
<hr>
Shouldn't bubble sort be O(N<sup>N</sup>) as you might have to process the entire thing once for each element, if it was sorted backwords for example?
227909
227909