Developer Tools●●Solid
Faster than std:sort and pdqsort
Beats std::sort by 30% on M1 using sorting networks to eliminate conditional branches.
Big Brain
chrka
1016d ago
Back to browse
Branchless Quicksort – faster than std:sort and pdqsort
by chrka·May 12, 2026·2 points·0 comments
AI Analysis
●●●BangerWizardryBig Brain
Beats std::sort and pdqsort by replacing branches with sorting networks.
Strengths
- •Sorting-network hybrid approach eliminates branch misprediction penalties.
- •Verified 2x speedup over baseline quicksort on Apple M1 hardware.
- •Full C source included with macro-based type flexibility.
Weaknesses
- •Niche applicability; most apps won't hit quicksort as a bottleneck.
- •No SIMD vectorization mentioned, leaving more optimization on table.
Category
Target Audience
Systems programmers, performance engineers
Similar To
pdqsort · ips4o
Similar Projects
Developer Tools●●●Banger
Faster than std:sort and pdqsort
Beats std::sort by 24% on M1 using sorting networks for small subsets and branchless partitioning.
WizardryBig Brain
chrka
1014d ago
Developer Tools●●Solid
Avoiding "if" makes Quicksort faster
Removing branches from Quicksort cuts sort time in half on Apple Silicon.
Big BrainWizardry
chrka
3427d ago
Developer Tools●●Solid
A Fast Quicksort in C with Branch‑Avoidant Coding and Threads
Branch-avoidant stores beat std::sort on M1, but it's a micro-optimization of a solved algorithm.
Big BrainNiche Gem
chrka
101mo ago
Developer Tools●●Solid
Fast, branchless single/multithreaded Quicksort for C/C++
Branchless partitioning with 512-element stack buffer beats pdqsort on M1 and Ryzen.
Big BrainNiche Gem
chrka
102d ago
Infrastructure●●●Banger
Pg_sorted_heap–Physically sorted PostgreSQL with builtin vector search
Zone-mapped sorted heap with 30x smaller IVF index than HNSW, no pgvector limits.
WizardryBig Brain
skuznetsov37
1012mo ago