[FEATURE REQUEST] Smooth Sort Sorting Algorithm

[Harshsaini001]

What would you like to Propose?

I would like to propose adding Smooth Sort, an optimized variant of Heap Sort developed by Edsger Dijkstra.
It adapts to partially sorted data, achieving near-linear performance in the best case.

Issue details

The repository currently lacks an implementation of Smooth Sort.
This algorithm complements existing sorts by offering adaptive, in-place sorting performance, improving efficiency for nearly sorted datasets.

Additional Information

No response

[Harshsaini001]

Hi! I would like to work on this issue and add the implementation of Smooth Sort in the sorts package.
Could you please assign it to me?