1. Write a program to implement the closest-pair algorithm.
2. What is the asymptotic running time of quickselect using a median-of-median-of- three partitioning strategy?
3. Show that quickselect with median-of-median-of-seven partitioning is linear. Why is median-of-median-of-seven partitioning not used in the proof?
4. Implement the quickselect algorithm in Chapter 7, quickselect using median- of-median-of-?ve partitioning, and the sampling algorithm at the end of Section 10.2.3. Compare the running times.