Problem
1. Explain why mergesort is better for linked lists than for contiguous lists.
2. In quicksort, why did we choose the pivot from the center of the list rather than from one of the ends?
3. On average, about how many more comparisons of keys does quicksort make than the optimum? About how many comparisons does it make in the worst case?