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 18, 2026·1 point·0 comments
AI Analysis
●●SolidBig Brain
Beats std::sort by 30% on M1 using sorting networks to eliminate conditional branches.
Strengths
- •Uses a 512-element stack array buffer inspired by fluxsort to avoid heap allocation overhead.
- •Implements custom sorting networks for subsets of 2 to 12 elements to minimize swaps.
- •Switches to heapsort automatically when detecting partition imbalance to prevent O(n²) worst cases.
Weaknesses
- •Branchless sorting is a well-researched topic with existing optimized libraries like pdqsort.
- •Performance gains are hardware-dependent and may not translate to all CPU architectures.
Category
Target Audience
Systems programmers and performance engineers
Similar To
pdqsort · fluxsort
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
1025d 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
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
102mo 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