Review

Last time, we talked about several algorithms for sorting.

• Insertion sort, bubble sort, and selection sort are all $\Theta(n^2)$ algorithms in the worst case.
• Merge sort is $\Theta(n \log n)$ in the worst case.
• Quicksort is a lot like merge sort on average...