Log inSign up

Home / Lectures / Introduction to Algorithms

Still from the lecture
Computer Science

Lecture 3: Insertion Sort, Merge Sort

Course
Introduction to Algorithms
Instructor
Srini Devadas
Department
Electrical Engineering and Computer Science
Recorded
Fall 2011
Level
Undergraduate
▶ Watch the lecture

Free account required. The lecture opens at MIT OpenCourseWare.

About this lecture

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.

← Lecture 2: Models of Computation, Document DistanceLecture 4: Heaps and Heap Sort →

More in Computer Science

Still from the lecture “Lecture 1: What is Computation?”
Computer Science

Lecture 1: What is Computation?

Introduction to Computer Science and Programming in Python · Dr. Ana Bell

Still from the lecture “Lecture 2: Branching and Iteration”
Computer Science

Lecture 2: Branching and Iteration

Introduction to Computer Science and Programming in Python · Dr. Ana Bell

Still from the lecture “Lecture 3: String Manipulation, Guess and Check, Approximations, Bisection”
Computer Science

Lecture 3: String Manipulation, Guess and Check, Approximations, Bisection

Introduction to Computer Science and Programming in Python · Dr. Ana Bell