Jump to content

Adaptive heap sort

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Mjuarez (talk | contribs) at 12:51, 3 March 2006 (Created). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The adaptive heap sort is a variant of heap sort that uses a randomized binary search tree, or RBST, to structure the input according to any preexisting order. The RBST is used to select candidates that are put into the heap, so the heap doesn't need to keep track of all elements.


See also


Public Domain This article incorporates public domain material from Paul E. Black. heap sort.html "Adaptive heap sort". Dictionary of Algorithms and Data Structures. NIST. {{citation}}: Check |url= value (help)

Retrieved from "https://en.wikipedia.org/w/index.php?title=Adaptive_heap_sort&oldid=42047125"