Radix sorting (no qsort) for floating point numbers
Open
Nobody has claimed this yet.
- Dominant language
- C++
- Stars
- 1k
- Forks
- 74
- PR merge metrics
- No merged PRs in 30d
Description
I have implemented radix sorting for floating point numbers (float and double) which is O(N) instead of O(N*log(N)) (qsort).
Are you interested? It is faster than qsort with large values of N. (last time I tested, N was something like 10^6 if I remember correctly)
Contributor guide
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
The issue contains no file, test, or entry point, and only proposes radix sorting for floating-point values as an alternative to qsort. First review the existing sorting implementation and benchmark coverage, then determine whether a concrete integration proposal and performance comparison can be defined as done.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- performance
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100