Lecture 3: Insertion Sort, Merge Sort

Published: Aug. 16, 2013, 5:01 p.m.

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.