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.
See also
External link
This article incorporates public ___domain material from Paul E. Black. "Adaptive heap sort". Dictionary of Algorithms and Data Structures. NIST.
 | This computer science article is a stub. You can help Wikipedia by expanding it. |