4 ms·
But they can sort 16 nibbles twice, and then you can use merge-sort between the two sets of nibbles. Which would scale at O(n*log(n)). Which is asymptotically
by dragontamer 11y ago
But they can sort 16 nibbles twice, and then you can use merge-sort between the two sets of nibbles.
Which would scale at O(n*log(n)). Which is asymptotically optimal IIRC.