Show how n integers in the range 1 to n^{2} can be sorted in O(n) time.

Use a Radix-n sort.

Each digit requires n symbols, and log_{n} n^{2} digits are needed (d=2, k=n).