Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Adaptive heap sort
open-in-new
<p>In computer science, adaptive heap sort is a <a href="/facts/Comparison_sort/X1PvE50c">comparison-based</a> <a href="/facts/Sorting_algorithm/PwHpj1Gs">sorting algorithm</a> of the <a href="/facts/Adaptive_sort/8BPWrNSD">adaptive sort family</a>. It is a variant of <a href="/facts/Heapsort/Cz22lLKq">heap sort</a> that performs better when the data contains existing order. Published by Christos Levcopoulos and Ola Petersson in 1992, the algorithm utilizes a new measure of presortedness, <i>Osc,</i> as the number of oscillations. Instead of putting all the data into the heap as the traditional heap sort did, adaptive heap sort only take part of the data into the heap so that the run time will reduce significantly when the presortedness of the data is high. </p>