Divide and conquer sorts

We looked at the running time of insertion sort and selection sort, and discovered that they were both O(n2).

We discussed divide and conquer algorithms generally.

We showed Mergesort, and analyzed it to discover that it runs in time O(nlog n), but takes additional space to do the merging.

We showed Quicksort, which has O(n2) performance in the worst case, but if the pivot is selected randomly, runs in O(nlog n) time on average.