Adaptive heap sort: Difference between revisions

Content deleted Content added
Citation bot (talk | contribs)
Altered template type. | Use this bot. Report bugs. | Suggested by Abductive | Category:Heaps (data structures) | #UCB_Category 1/31
Citation bot (talk | contribs)
Altered title. Added chapter. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | #UCB_CommandLine
Line 80:
 
=== Other measures ===
Besides the original Osc measurement, other known measures include the number of inversions ''Inv'', the number of runs ''Runs'', the number of blocks ''Block'', and the measures ''Max'', ''Exc'' and ''Rem''. Most of these different measurements are related for adaptive heap sort. Some measures dominate the others: every Osc-optimal algorithm is Inv optimal and Runs optimal; every Inv-optimal algorithm is Max optimal; and every Block-optimal algorithm is Exc optimal and Rem optimal.<ref name=":2">{{Cite book|last1=Edelkamp|first1=Stefan|last2=Elmasry|first2=Amr|last3=Katajainen|first3=Jyrki|s2cid=10325857|date=2011|editor-last=Iliopoulos|editor-first=Costas S.|editor2-last=Smyth|editor2-first=William F.|titlechapter=Two Constant-Factor-Optimal Realizations of Adaptive Heapsort|journaltitle=Combinatorial Algorithms|volume=7056|series=Lecture Notes in Computer Science|publisher=Springer Berlin Heidelberg|pages=195–208|doi=10.1007/978-3-642-25011-8_16|isbn=9783642250118}}</ref>
 
== Algorithm ==