3 ms·
I remember learning in my college algorithms class that radix sort is 'slow in practice' because it's 'not cache friendly' then when we had a sorting speed comp
by opencl 7y ago
I remember learning in my college algorithms class that radix sort is 'slow in practice' because it's 'not cache friendly' then when we had a sorting speed competition project the fastest entry was a radix sort.