Our great sponsors
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
A while ago I was tinkering with Quicksort and avoiding branch mispredictions.
https://easylang.online/blog/qsort_c.html
My implementation is pretty fast. At a size of 40 or 50, I switch to Insertion sort, and there the branchless bubblesort is significantly slower (I just tried it).
But I have to admit defeat to this SampleSort:
https://github.com/SaschaWitt/ips4o
NOTE:
The number of mentions on this list indicates mentions on common posts plus user suggested alternatives.
Hence, a higher number means a more popular project.
Related posts
- Do Low-Level Optimizations Matter?
- FreeBSD replaces bubblesort with mergesort on SYSINTs, results in 100x speed
- Fluxsort: A stable quicksort, now faster than Timsort for both random and ordered data
- 10~17x faster than what? A performance analysis of Intel x86-SIMD-sort (AVX-512)
- GitHub - scandum/fluxsort: A branchless stable quicksort / mergesort hybrid.