pdqsort

Uses median-of-3 pivot selection and insertion sort for small arrays, achieving speeds comparable to quicksort on typical data, as shown in benchmarks against std::sort.

Detects patterns like sorted or equal elements and sorts them in linear time, optimizing for common real-world inputs such as ascending or descending orders.

Switches to heapsort after detecting too many bad partitions, ensuring O(n log n) worst-case complexity and avoiding quadratic slowdowns inherent in naive quicksort.

Automatically uses branchless partitioning for arithmetic types in C++11, reducing branch mispredictions and offering significant speedups for large arrays, as detailed in the README.