Content deleted Content added
Added link to adaptive sort |
m Wrong order of arguments in pipe. |
||
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. Adaptive heap sort is a part of the [[Adaptive sort|adaptive sorting family]].
The first adaptive heapsort was [[Smoothsort| Dijkstra's
==See also==
| |||