Radix Sort
Therefore, at first glimpse, this method
looks rather efficient.
However, it does require large amounts of
memory to handle each group if implemented
as an array.
Therefore, a radix sort is more appropriate for
a linked list than for an array.
Also notice that the worst case and the
average case (or even the best case) all will
take the same number of moves.