6 ms·
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
by 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.