Lecture 3: Insertion Sort, Merge Sort - Listen - Introduction to

Introduction to Algorithms (2011)

Lecture 3: Insertion Sort, Merge Sort

Listen now

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.

More Episodes

See all »

Recitation 8: Simulation Algorithms

This recitation discusses the first problem from Problem Set 3, covering sweep-line algorithms and range queries.

Published 08/16/13

Recitation 7: Comparison Sort, Counting and Radix Sort

This recitation starts with a review of comparison sorting methods, and then discusses counting sort and radix sort.

Published 08/16/13

Lecture 2: Models of Computation, Document Distance

This lecture describes an algorithm as a computational procedure to solve a problem, covers the random access machine and pointer models of computation, and introduces the document distance problem.

Published 08/16/13