Lecture 3: Insertion Sort, Merge Sort

Name: Lecture 3: Insertion Sort, Merge Sort
Uploaded: 2013-01-14T20:26:48Z
Duration: 51 min 20 s
Description: 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

51:20

Up Next

Lecture 4: Heaps and Heap Sort

Continue

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