Adaptive heap sort
From Wikipedia, the free encyclopedia
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.
The first adaptive heapsort was Dijkstra's Smoothsort.
[edit] See also
[edit] External links
- Paul E. Black, Adaptive heap sort at the NIST Dictionary of Algorithms and Data Structures.
 |
This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |
