Content deleted Content added
CJLL Wright (talk | contribs) m category rename per CfD 2007 May 24 using AWB |
m Typo |
||
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
==See also==
* [[Adaptive sort]]
| |||