Adaptive heap sort: Difference between revisions
Content deleted Content added
m robot Adding: pt:Heap sort adaptativo |
m Robot - Moving category Heaps (structure) to Category:Heaps (data structures) per CFD at Wikipedia:Categories for discussion/Log/2012 January 12. |
||
| Line 11: | Line 11: | ||
[[Category:Sorting algorithms]] |
[[Category:Sorting algorithms]] |
||
[[Category:Comparison sorts]] |
[[Category:Comparison sorts]] |
||
[[Category:Heaps ( |
[[Category:Heaps (data structures)]] |
||
{{datastructure-stub}} |
{{datastructure-stub}} |
||
Revision as of 01:07, 17 January 2012
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 sorting family.
The first adaptive heapsort was Dijkstra's Smoothsort.
See also
External links
This article incorporates public domain material from Paul E. Black. "Adaptive heap sort". Dictionary of Algorithms and Data Structures. NIST.
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |