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
2022d ago

Client-side sorting and true post ages for Hacker News, but the store listing is unavailable.
Frequent Hacker News readers
Refined Hacker News · Hacker News Enhanced
Beats std::sort and pdqsort by replacing branches with sorting networks.
Zone-mapped sorted heap with 30x smaller IVF index than HNSW, no pgvector limits.
Beats std::sort by 24% on M1 using sorting networks for small subsets and branchless partitioning.
Educational sorting visualizer using a custom teaching language instead of Python.
Sorting visualizer when Visualgo and dozens of alternatives already exist.
Beats std::sort by 30% on M1 using sorting networks to eliminate conditional branches.