Lecture 35

Learning objectives

After this class, you should be able to:

1. Given data to be sorted, show the data after each step of quicksort.
2. Explain the advantages and disadvantages of different types of pivot choces for quicksort.
3. Derive the best case and worst case time complexities for quicksort.
4. Give the average case time complexity for quicksort.

Reading assignment

1. Section 7, section 7.7.
2. Lecture: Sorting.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Show the steps involved in sorting the following data using quicksort with the median of three partitioning: 16 14 10 8 7 9 3 2.
  2. Show the steps involved in sorting the following data using quicksort with the median of the first element as pivot: 16 14 10 8 7 9 3 2.

• Questions on next lecture's material
  1. None.

---

Last modified: 29 Nov 2011