Developer Tools●●Solid
Avoiding "if" makes Quicksort faster
Removing branches from Quicksort cuts sort time in half on Apple Silicon.
Big BrainWizardry
chrka
341mo ago
Back to browse
A Fast Quicksort in C with Branch‑Avoidant Coding and Threads
by chrka·Apr 29, 2026·1 point·0 comments
AI Analysis
●●SolidBig BrainNiche Gem
Branch-avoidant stores beat std::sort on M1, but it's a micro-optimization of a solved algorithm.
Strengths
- •Demonstrates measurable speedups by eliminating branch mispredictions in partition logic.
- •Benchmarks show 4x improvement over baseline on Apple M1 using manual stack management.
- •Falls back to sorting networks for small ranges to minimize recursion overhead.
Weaknesses
- •Highly specialized optimization that offers little value for general application development.
- •Performance gains are hardware-specific and may not translate to non-Apple Silicon architectures.
Category
Target Audience
Systems programmers and performance engineers
Similar To
std::sort · folly · Abseil
Similar Projects
Developer Tools●●●Banger
Branchless Quicksort – faster than std:sort and pdqsort
Beats std::sort and pdqsort by replacing branches with sorting networks.
WizardryBig Brain
chrka
201mo ago
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
1027d 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
1013d ago
Productivity●Mid
PolyClaude – Using math to pay less for Claude Code
Clever rate-limit arbitrage via pre-activation scheduling, but only works if you own multiple accounts.
Big BrainNiche GemSolve My Problem
armanj
103mo ago
Developer Tools●●Solid
Solving complex optimization problems with Google OR-Tools in browser
Multithreaded WASM brings serious optimization to the browser.
WizardryBig Brain
AxelWickman
12811d ago