Introduction to Algorithms: Insertion Sort, Merge Sort

Insertion Sort, Merge Sort

Sorting is introduced, and motivated by problems that become easier once the inputs are sorted. The lecture covers insertion sort, then discusses merge sort and analyzes its running time using a recursion tree.