Comment Comment by smingo Not for big arrays.Radix sort is O[n] . (or [n * number of bytes in Int] or whatever is being compared).It's omitted from the comparisons, I see. Radix sort can also have predictable memory overhead. parent smingo 3 years ago
Radix sort is O[n] . (or [n * number of bytes in Int] or whatever is being compared).
It's omitted from the comparisons, I see. Radix sort can also have predictable memory overhead.