In our previous post, we talked about radix sort in combination with count sort, which is faster than the standard std::sort algorithm.
Looking at the original algorithm, it is possible to optimize it more.
Our quest for faster sorting continues.
...continue reading "Squeezing the Last Bit: Sorting integers on CPU O(n)"