Next: Up: Previous:

Analysis

If each digit is in the range 1 to k, use CountingSort
Each pass over a digit is $\Theta(n \;+\; k)$
For d digits $\Theta(dn \;+\; dk)$
If d is a constant and k = O(n), T(n) = O(n)

Radix-n implies each digit can differentiate among n different symbols. For example, in the previous case we assumed radix-10. This is why the name Radix Sort is given.

Next: Up: Previous: