Unless you're sorting >2<number of bits / element> elements, that logarithmic factor will be better than the constant of radix sort. Asymptotic complexity with

Unless you're sorting >2<number of bits / element> elements, that logarithmic factor will be better than the constant of radix sort. Asymptotic complexity with (sub)logarithmic factors is iffy at best, and this is a shining example thereof.