Adaptive heap sort: Difference between revisions

Revision as of 23:24, 28 May 2007

Revision as of 07:48, 5 June 2007

Line 1:

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.

The first adaptive heapsort was Dijstra's smoothsort.

==See also==

Line 6 ⟶ 7:

==External link==

*{{DADS|Adaptive heap sort|adaptiveHeapSort}}

[[Category:SortSorting algorithms]]

[[Category:Comparison sorts]]

[[Category:Heaps (structure)]]

{{comp-sci-stub}}

[[Category:Sort algorithms]]

[[Category:Comparison sorts]]

[[Category:Heaps (structure)]]