Jump to content

Adaptive heap sort

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Chris-martin (talk | contribs) at 03:43, 20 June 2006 (external link heading). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The adaptive heap sort is a sorting algorithm that is similar to heap sort, but 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. "Adaptive heap sort". Dictionary of Algorithms and Data Structures. NIST.


Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

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