Lecture Videos

Lecture 3: Insertion Sort, Merge Sort

Description: 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.

Instructor: Srini Devadas

Lecture Notes
Lecture slides (PDF) (Courtesy of Charles Leiserson, Piotr Indyk, Constantinos Daskalakis, and Srini Devadas. Used with permission.)

Course Info

Learning Resource Types

theaters Lecture Videos
theaters Recitation Videos
assignment_turned_in Problem Sets with Solutions
grading Exams with Solutions
assignment_turned_in Programming Assignments with Examples
notes Lecture Notes