Problem: sort 1 million 64-bit numbers
- Treat as four-digit radix 216 numbers
- Can sort in just four passes with radix sort!
Compares well with typical O(n lg n) comparison sort
- Requires approx lg n = 20 operations per number being sorted
So why would we ever use anything but radix sort?