3 ms·
Exactly. It has the same limitations as a radix sort, which is why I find them comparable
by lpapez 5y ago
Exactly. It has the same limitations as a radix sort, which is why I find them comparable
- bradleyjg 5y agoFor 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.