A C++ Quicksort Faster Than std::sort

This page describes blqsort, a C/C++ quicksort implementation that uses branchless partitioning, sorting networks for small partitions, and robust pivot selection to outperform std::sort on random data. It links to MIT-licensed C and C++ implementations (including single-header and multithreaded versions) and shows benchmark results and code examples explaining the algorithmic ideas.

• Branchless partitioning reduces branch mispredictions
• Use sorting networks for small partitions instead of insertion sort
• Provides MIT-licensed single-file C/C++ implementations and benchmarks