Show HN: Branchless Quicksort – faster than std:sort and pdqsort

Category: library

Tags: sorting, c-library, algorithm, branchless, performance-optimization

Score: 7.5/10 (Innovation: 7, Technical: 9, Documentation: 7, Utility: 7)

Fluxsort is a highly optimized, stable quicksort/mergesort hybrid that achieves exceptional performance through branchless partitioning, adaptive pivot selection, and intelligent fallback to quadsort for small or nearly-sorted data. Its innovative combination of techniques like cubic root median selection and memory-level parallelism makes it notably faster than std::sort and pdqsort in many benchmarks.

Target audience: backend devs, data engineers

Repository: https://easylang.online/blog/qsort · C · Unlicense · 737 stars

View on Hacker News