According to the benchmarks, pdqsort only really helps for Go's integer sort. The fastest way to sort integers is a radix-256 increasing-significance radix sor

According to the benchmarks, pdqsort only really helps for Go's integer sort. The fastest way to sort integers is a radix-256 increasing-significance radix sort, and that has been a well-known fact since the 1960's. In other words: a stable bytewise counting sort, sorting from least-significant byte to most-significant byte. A comparison sort, no matter how clever, will not outperform a radix sort, except for very small arrays or very large (many byte) integers.