Introduction to Algorithms (2011‪)‬ MIT

Overview of course content, including an motivating problem for each of the modules. The lecture then covers 1-D and 2-D peak finding, using this problem to point out some issues involved in designing efficient algorithms.

This recitation covers asymptotic complexity, recurrences, and peak finding.

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.

This recitation covers the Python cost model and looks at the code for document distance, including main and most functions except count_frequency.

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.

This recitation continues to look at versions of the document distance code, and briefly discusses insertion and merge sort.