Adaptive heap sort: Difference between revisions

Revision as of 03:43, 20 June 2006

Revision as of 08:45, 6 July 2006

Line 1:

The '''adaptive heap sort''' is a [[sorting algorithm]] that is similar to [[heap sort]], but uses a randomized [[randomized binary search]] tree, or [[RBST]], to structure the input according to any preexisting order. The RBSTrandomized 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==