(algorithm)
Definition: A variant of heapsort that uses a randomized binary search tree (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 adaptive sort.
Author: IR
C. Levcopoulos and O. Petersson, Adaptive Heapsort, J. of Algorithms 14:395-413, 1993.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:02:00 2004.
HTML page formatted Wed Oct 26 09:47:08 2005.
Cite this as:
Ingo Rohloff, "adaptive heap sort", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/adaptiveHeapSort.html
