CS 240: Lecture 21 – Quicksort and Radix Sort
Today we’ll start by walking through the exercises that you started working on last time. We’ll calculate the best and worst case running times of quicksort and reason about why it’s still considered a good sort even though its worst case is no different than insertion sort or selection sort.
During the remainder of our time together, we’ll work through an exercise on radix sort.
You have some work to do before the next class:
- Submit today’s muddiest point.
See you next time.