51 min

Lecture 3: Insertion Sort, Merge Sort Introduction to Algorithms (2011)

    • Technology

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.

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.

51 min

Top Podcasts In Technology

More by MIT