Adaptive heap sort
In computer science, adaptive heap sort is a comparison-based sorting algorithm of the adaptive sort family. It is a variant of heap sort that performs better when the data contains existing order. Published by and in 1992, the algorithm utilizes a new measure of presortedness, Osc, 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.
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Adaptive heap sort
In computer science, adaptive heap sort is a comparison-based sorting algorithm of the adaptive sort family. It is a variant of heap sort that performs better when the data contains existing order. Published by and in 1992, the algorithm utilizes a new measure of presortedness, Osc, 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.
has abstract
In computer science, adaptive ...... ortedness of the data is high.
@en
O heap sort adaptativo é um al ...... foi o Smoothsort de Dijkstra.
@pt
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,020,138,397
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
In computer science, adaptive ...... ortedness of the data is high.
@en
O heap sort adaptativo é um al ...... foi o Smoothsort de Dijkstra.
@pt
label
Adaptive heap sort
@en
Heap sort adaptativo
@pt