Adaptive heap sort: Difference between revisions

Revision as of 02:23, 21 July 2020

Revision as of 11:43, 27 April 2021

Line 68:

== Measures of presortedness ==

[[Measure of presortedness|Measures of presortedness]] measures the existing order in a given sequence.<ref>{{Cite journal|last=Mannila|first=Heikki|date=April 1985|title=Measures of Presortedness and Optimal Sorting Algorithms|journal=IEEE Transactions on Computers|volume=C-34|issue=4|pages=318–325|doi=10.1109/TC.1985.5009382|issn=0018-9340}}</ref> These measures of presortedness decides the number of data that will be put in to the heap during the sorting process as well as the lower bound of running time.<ref name=":2" />

=== Oscillations (''Osc'') ===