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
Back to browse
Faster than std:sort and pdqsort
by chrka·May 20, 2026·1 point·0 comments
AI Analysis
●●●BangerWizardryBig Brain
Beats std::sort by 24% on M1 using sorting networks for small subsets and branchless partitioning.
Strengths
- •Custom sorting networks for 2-12 elements minimize swaps using branchless sort-2 primitives.
- •Median-of-medians pivot selection prevents O(n²) degradation on adversarial input data.
- •BlockQuicksort variant handles complex types by processing indices instead of moving data.
Weaknesses
- •Performance gains diminish significantly for types with high copy or move costs.
- •Requires separate code paths for each small subset size, increasing binary complexity.
Category
Target Audience
Systems programmers and performance engineers
Similar To
pdqsort · fluxsort · folly::sort
Similar Projects
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
1026d 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
1012d 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
1013mo ago
Education●Mid
Interactive sorting algorithm visualizations with runtime comparisons
Educational sorting visualizer using a custom teaching language instead of Python.
CozyNiche Gem
chrka
101mo ago
Education●Mid
Interactive demos of sorting algorithms with runtime comparisons
Sorting visualizer when Visualgo and dozens of alternatives already exist.
Niche Gem
chrka
101mo ago