Next: Up: Previous:

Example

Show how n integers in the range 1 to n² can be sorted in O(n) time.

Use a Radix-n sort.

Each digit requires n symbols, and log_n n² digits are needed (d=2, k=n).

T(n) = $\Theta(2n \;+\; 2k)$

= $\Theta(2n \;+\; 2n)$

= $\Theta(n)$

Next: Up: Previous: