blitsort
quadsort
| blitsort | quadsort | |
|---|---|---|
| 15 | 9 | |
| 699 | 2,106 | |
| - | - | |
| 3.3 | 4.6 | |
| 6 days ago | 6 months ago | |
| C | C | |
| The Unlicense | The Unlicense |
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
quadsort
-
10~17x faster than what? A performance analysis of Intel x86-SIMD-sort (AVX-512)
https://github.com/scandum/quadsort/blob/f171a0b26cf6bd6f6dc...
As you can see, quadsort 1.1.4.1 used 2 instead of 4 writes in the bi-directional parity merges. This was in June 2021, and would have compiled as branchless with clang, but as branched with gcc.
When I added a compile time check to use ternary operations for clang I was not adapting your work. I was well aware that clang compiled ternary operations as branchless, but I wasn't aware that rust did as well. I added the compile time check to use ternary operations for a fair performance comparison against glidesort.
https://raw.githubusercontent.com/scandum/fluxsort/main/imag...
As for ipnsort's small sort, it is very similar to quadsort's small sort, which uses stable sorting networks, instead of unstable sorting networks. From my perspective it's not exactly novel. I didn't go for unstable sorting networks in crumsort to increase code reuse, and to not reduce adaptivity.
-
Show HN: QuadSort, Esoteric Fast Sort
In the code it looks like the seed to the benchmark can be provided as the 4th command line argument: https://github.com/scandum/quadsort/blob/master/src/bench.c#...
-
When does big-oh notation become not helpful when comparing algorithms?
If you look at sorting for example, it's been proven that you can't do a comparison-based sort faster than O(n logn). You may then think that we've already found the fastest possible sorting algorithms since Quicksort and Mergesort are already O(n logn). However, new sorting algorithms keep being invented, for example Quadsort. They're all still O(n logn), but they do offer a considerable speed improvement over more traditional algorithms
- quadsort 1.1.5.1: Up to 2.5x faster than qsort() on random data
- Quadsort 1.1.5.1: Introducing cost effective branchless merging
- I tried creating a sorting algorithm in C language.
What are some alternatives?
pdqsort - Pattern-defeating quicksort.
fluxsort - A fast branchless stable quicksort / mergesort hybrid that is highly adaptive.
gridsort - A stable adaptive partitioning comparison sort.
Klib - A standalone and lightweight C library
tremc - Curses interface for transmission
sort-test - A simple sort benchmarking tool
highway - Performance-portable, length-agnostic SIMD with runtime dispatch
rotate - A collection of array rotation algorithms.
ram_bench - A benchmark for random memory accesses
fastrange - A fast alternative to the modulo reduction