Not based on the general sorting strategy.
Requires minimum amount of space and minimum of data movement.
Does no comparisons!
Ideal for linked list with integer KEYs.
Sorts elements by looking at their KEYs one digit at a time:
First it sorts them according to their least significant digit.
Then according to their second least significant digit, etc...
Invariant: after round n, the list (concatenation of the buckets) is sorted according to the n least significant digits.
Example:
362 745 885 957 054 786 080 543 012 565
Because the keys consist of base 10 digits, we will need an array of 10 buckets indexed by the possible values of the digits.