sort-test
quadsort
| sort-test | quadsort | |
|---|---|---|
| 1 | 9 | |
| 0 | 2,107 | |
| - | - | |
| 0.0 | 4.6 | |
| almost 2 years ago | 7 months ago | |
| C | C | |
| GNU General Public License v3.0 only | 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.
sort-test
-
sort algorithm comparison tool
You can see the (open source) sort tool here: https://github.com/hareball/sort-test
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?
Fortress-of-Solitude - This Library has resources to solve common data structure algorithm problems like a Doubly linked list, Generic trees, Queue, Stack, and other algorithms. Each lib has an option to carry your custom data in elements. Custom data in detail, other fantastic resources.
pdqsort - Pattern-defeating quicksort.
combsort.h - optimized combsort macro
fluxsort - A fast branchless stable quicksort / mergesort hybrid that is highly adaptive.
blitsort - Blitsort is an in-place stable adaptive rotate mergesort / quicksort.
Klib - A standalone and lightweight C library
rotate - A collection of array rotation algorithms.
fastrange - A fast alternative to the modulo reduction
sort-research-rs - Test and benchmark suite for sort implementations.
HSL - HSL to RGB and RGB to HSL
piposort - Piposort is a small branchless stable adaptive mergesort.
rhsort - Robin Hood Sort, for uniform data