heapsort
worst-case optimal in-place comparison sorting algorithm based on the heap data structure
Facts
9 properties- Instance of
- sorting algorithm, comparison sort[3]
- Average time complexity
- O(n \log(n))
- Best-case time complexity
- O(n \log(n))
- Derivative work
- smoothsort[6]
- Discoverer or inventor
- J. W. J. Williams[2]
- Time of discovery or invention
- 1964[4]
- Worst-case space complexity
- O(1)
- Worst-case time complexity
- O(n \log(n))
🏷️ Also known as
en heapsort
ar تصنيف الكومة
cs heapsort
cs haldové třídění
cs řazení haldou
cs heap sort
de Heap Sort
de Heap-Sort
de Haldensortierung
es ordenamiento por monticulos
es heap sort
es ordenamiento por montículos
fa الگوریتم مرتب سازی هرمی
fa مرتب سازی دودویی
fa مرتبسازی هرمی
fa مرتب سازی هرمی
fi Kekolajittelu
fr heapsort
fr tri par tas
he מיון ערימה
🔖 Identifiers · 8
- Image (Wikimedia Commons)
- Sorting heapsort anim.gif ↗
- Brilliant Wiki ID
- heap-sort
- Freebase ID
- /m/03mwc
- MathWorld ID
- Heapsort
- Microsoft Academic ID (discontinued)
- 55201436
- PlanetMath ID
- Heapsort
- Rosetta Code page ID
- Sorting_algorithms/Heapsort
🔗 Connections
Instance of 2
Derivative work 1
Discoverer or inventor 1
Maintained by WikiProject 1
Uses 1
← Based on 1
Press Enter · cited answer in seconds
0 sources
Summary
heapsort is a sorting algorithm[1].