MIT

Lecture 3: Insertion Sort, Merge Sort

Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceEngineering

Om kurset

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