JuliaCollections / JuliaCollections/SortingAlgorithms.jl
Implement SmoothSort
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 54
- Forks
- 27
- PR merge metrics
- No merged PRs in 30d
Description
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
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reviewing the smoothsort draft in the linked gist and comparing it with the repository's Julia sorting API and the comb sort work referenced in PR #54. The issue does not name a repository file or test; done would require a settled implementation and agreement that it is ready for a pull request.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- performance
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100