Smooth Sort

Smooth Sort is a comparison-based in-place sorting algorithm developed by Edsger Dijkstra. It is a variation of Heap Sort that adapts to partially sorted data to achieve near-linear time for sorted inputs.