glidesort
blitsort
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
glidesort
-
A Rust port of crumsort, up to 75% faster than pdqsort
How does this compare to the recent glidesort algorithm? Why should someone prefer this to that one?
-
The Smallest Hash Table
For context this is written by the creator of Glidesort:
https://github.com/orlp/glidesort
- Orlp/glidesort: a Rust implementation of Glidesort, my stable adaptive quicksor
-
Reinforcement learned branchless sorting functions for sort3, sort4 and sort5 were landed in LLVM
With the recent release of Glidesort I remembered this change that recently landed in LLVM.
- Glidesort, a new stable sort in Rust up to ~4x faster for random data
-
Can C++ be the language of choice for new algo development?
In recent years at least one implementation of std sort was replaced by newer algo. Back when it was discussed there was an announcement of other people trying to improve sorting algorithms. Here is example of one https://github.com/orlp/glidesort ( beware it is written in Rust ).
- Show HN: Glidesort, a new stable sort in Rust up to ~4x faster for random data
blitsort
- Glidesort, a new stable sort in Rust up to ~4x faster for random data
- GitHub - scandum/blitsort: Blitsort is an in-place stable adaptive rotate mergesort / quicksort (Not C#)
-
Hacker News top posts: Dec 2, 2022
Blitsort: A fast, in-place stable hybrid merge/quick sort\ (62 comments)
- Blitsort: A fast, in-place stable hybrid merge/quick sort
-
Blitsort: An ultra-fast in-place stable hybrid merge/quick sort
Looks like the author added the `LICENSE` file in repo root after this comment: https://github.com/scandum/blitsort/blob/main/LICENSE
This is always a great point to bring up, though. People who don't properly declare the license of their OSS projects are (either unintentionally or internionally) make it a headache for companies to use. I'm not saying it's bad to explicitly deny corporate use (via GPL, etc.). The real problem IMO is when other OSS projects vendor unlicensed code and then declare their projects to be under MIT license. Then if a corporation uses it, they're unknowingly violating the copyright of the transitive dep.
- Blitsort: An in-place stable sorting algorithm faster than qsort and pdqsort
- Blitsort: An in-place stable sorting algorithm faster than pdqsort
- I tried creating a sorting algorithm in C language.
- Blitsort is an in-place stable adaptive rotate merge sort
What are some alternatives?
sort-research-rs - Test and benchmark suite for sort implementations.
quadsort - Quadsort is a branchless stable adaptive mergesort faster than quicksort.
BQN - An APL-like programming language. Self-hosted!
pdqsort - Pattern-defeating quicksort.
fluxsort - A fast branchless stable quicksort / mergesort hybrid that is highly adaptive.
crumsort-rs - A parallelized Rust port of crumsort
gridsort - A stable adaptive partitioning comparison sort.
rhsort - Robin Hood Sort, for uniform data
tremc - Curses interface for transmission
sortnetopt - Lower Size Bounds for Sorting Networks
highway - Performance-portable, length-agnostic SIMD with runtime dispatch