Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Implement SmoothSort #55

Open
nlw0 opened this issue Mar 2, 2022 · 0 comments
Open

Implement SmoothSort #55

nlw0 opened this issue Mar 2, 2022 · 0 comments

Comments

@nlw0
Copy link
Contributor

nlw0 commented Mar 2, 2022

There's a PR open for comb sort (#54). I would like to submit an implementation for smoothsort next. Perhaps the greatest feature of smoothsort is that it performs well for approximately sorted inputs, like insertion sort tends to do, but smoothsort is O(n log n). It might make a good pairing with combsort.

I'm still investigating how well this implementation works, but I have a draft here, and it would be great to hear some feedback already. Especially because this is a slightly complicated algorithm. Does that look good? Should I just go ahead and start another PR, or is there some big issue I should try to figure out first?

https://gist.github.com/nlw0/6c56d7660fb1c5fa71cef654b9c25db2

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants