Problem
1. Compare the number of exchanges used by radix-exchange sort with the number used by Quicksort for the file 001, 011, 101, 110, 000, 001, 010, 111, 110, 010.
2. Why is it not as important to remove the recursion from the radix-exchange sort as it was for Quicksort?
3. Modify radix-exchange sort to skip leading bits which are identical on all keys. In what situations would this be worthwhile?