Radix Sort
•
Notice just from this pseudo code that the
radix sort requires N moves each time it
forms groups and N moves to combine
them again into one group.
•
This algorithm performs 2*N moves
"Digits" times.
•
Notice that there are no comparisons!
