Difference between revisions of "TADM2E 4.29"

Latest revision as of 18:13, 11 September 2014

If this claim was true one could construct a linear time sorting algorithm by inserting all elements and then extracting all maximum elements again. Since the lower bound of O(n log n) for searching this is not possible.