Adaptive heap sort: Difference between revisions

Revision as of 12:56, 3 March 2006

Revision as of 09:00, 4 March 2006

Line 1:

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 ==

* [[Adaptive sort]]

{{DADS|Adaptive heap sort|adaptiveHeapSort}}

[[Category:Sort algorithms]]

{{DADS|Adaptive heap sort|adaptiveHeapSort}}