Jump to content

Adaptive heap sort

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Marc van Leeuwen (talk | contribs) at 05:03, 19 July 2018 (Remove reference to smoothsort: the description given in this article does not apply to it at all). 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 to structure the input according to any preexisting order. The randomized binary search tree is used to select candidates that are put into the heap, so the heap doesn't need to keep track of all elements. Adaptive heap sort is a part of the adaptive sorting family.

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 algorithms or data structures-related 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=850966156"