Problem

1. Aside from the extra memory requirement, what is the major disadvantage of the strategy of doing straight radix sorting on the leading bits of the keys, then cleaning up with insertion sort afterwards?

2. Exactly how much memory is required to do a four-pass straight radix sort of N b-bit keys?

3. What type of input file will make radix-exchange sort run the most slowly (for very large N)?

4. Empirically compare straight radix sort with radix-exchange sort for a random file of 1000 32-bit keys.