Repository navigation
[FEATURE REQUEST] Smooth Sort Sorting Algorithm #6632
Description
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
Activity
Harshsaini001 commentedon Oct 5, 2025
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?
Shovon0004 commentedon Oct 9, 2025
Hi, I would like to work on this issue.
Please assign it to me. Thank you!
github-actions commentedon Nov 9, 2025
This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contribution!
GziXnine commentedon Jan 8, 2026
Hi maintainers
I’d like to work on this issue and implement Smooth Sort in the Java sorts package.
Planned approach:
SmoothSort.javaimplementation under the existing Java sorts structure.I’ll open a pull request once the implementation is ready.
Please let me know if you have any preferences or suggestions. Thanks!