Random cool shit you made thread.

GO!

Radix sort is O(nk), with k being the average key length. So with keys of a constant length, it's O(n). Of course, now you don't have a generic sorting algorithm anymore.