4 ms·

Radix sort wouldn’t allow for the “possible to sort any other data type” part. I do wonder about not enabling inlining structs. I don’t know where the crossove

Radix sort wouldn’t allow for the “possible to sort any other data type” part. I do wonder about not enabling inlining structs. I don’t know where the crossover happens, and it certainly varies with hardware characteristics, but I’m sure a data structure made up of say an int and two longs would better be sorted in contiguous memory rather than as an array of pointers to random places in the heap.

lpapez 5y ago
Exactly. It has the same limitations as a radix sort, which is why I find them comparable
- bradleyjg 5y ago
  For a radix sort it’s impossible to sort linked data structures, at least as I understand it. Whereas any comparison based sort can follow the pointers and do arbitrary comparisons.