4 ms·
The radix sort implementation is not optimal. Instead of sorting 1 digit at a time, it should be sorting 11 digits at a time to saturate the cache lines. So th
by xiaodai 2y ago
The radix sort implementation is not optimal. Instead of sorting 1 digit at a time, it should be sorting 11 digits at a time to saturate the cache lines.
So the baseline radix sort can be even faster.
- djmips 2y agoFrom the article - "This radix sort would be easy to make even faster. Instead, let us make one that is slower" The radix sort was used to provide an estimate for how much better the quicksort could improve.
- xiaodai 2y agobut why make a slower one? when a faster one is around? none of the x-times analysis make any sense now.