Smoothsort

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.

An adaptive in-place comparison sort based on Leonardo heaps.