Smoothsort Adaptive Heap Sort
Sort in place with a heap-like structure that keeps worst-case O(n log n) time while approaching linear time on nearly sorted input.
Tag
Heap-Sort
5 notes
Adaptive Heap Sort
A heap-based sorting method that adapts to partially ordered input to reduce unnecessary heap operations.
Weak Heap Sort
A variant of heapsort using weak heaps with fewer comparisons.
Smoothsort
An adaptive in-place comparison sort based on Leonardo heaps.
6.6 Heap Sort
Build a max-heap in place, then repeatedly extract the maximum to produce a sorted array in O(n log n) worst-case time.