QuickSort could have been kept as part of Sorting Lecture #2, but I prefer to give the students only 1 recursive sort at a time to struggle with. Once a student has successfully coded up a recursive merge sort, discussing QuickSort feels much easier.

Quick Idea of Quicksort (2:24)

Quicksort: Hoare's Partitioning (4:53)

Quicksort: Small Example (1:21)

QuickSort: Efficiency / Choosing a Pivot (3:45)

QuickSort Complexity & IRL (3:13)