blitsort
ram_bench
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.
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
ram_bench
- The Myth of RAM (2014)
-
Blitsort: An ultra-fast in-place stable hybrid merge/quick sort
> Radix sort is theoretically O(N),
Nothing theoretical about it: Sorting a list of all IP addresses can absolutely and trivially be done in O(N)
> in reality you can't do better than O(log N)
You can't traverse the list once in any sort must be ≥N.
> but memory access is logarithmic
No it's not, but it's also irrelevant: A radix sort doesn't need any reads if the values are unique and dense (such as the case IP addresses, permutation arrays, and so on).
> Edit: I misremembered, memory access is actually O(sqrt(N)): https://github.com/emilk/ram_bench
It's not that either.
The author ran out of memory; They ran a program that needs 10GB of ram on a machine with only 8GB of ram in it. If you give that program enough memory (I have around 105gb free) it produces a silly graph that looks nothing like O(√N): https://imgur.com/QjegDVI
The latency of accessing memory is not a function of N.
What are some alternatives?
quadsort - Quadsort is a branchless stable adaptive mergesort faster than quicksort.
highway - Performance-portable, length-agnostic SIMD with runtime dispatch
pdqsort - Pattern-defeating quicksort.
crumsort - A branchless unstable quicksort / mergesort that is highly adaptive.
fluxsort - A fast branchless stable quicksort / mergesort hybrid that is highly adaptive.
gridsort - A stable adaptive partitioning comparison sort.
tremc - Curses interface for transmission
combsort.h - optimized combsort macro
glidesort - A Rust implementation of Glidesort, my stable adaptive quicksort/mergesort hybrid sorting algorithm.