6.006 Introduction to Algorithms

As taught in: Spring 2008

Diagram of a binary search tree before and after rotation.

Rotation of a binary search tree, from the Recitation #4 slides. (Figure courtesy of Victor Costan.)

Level:

Undergraduate

Instructors:

Prof. Erik Demaine

Prof. Ronald Rivest

Prof. Srinivas Devadas

Course Features

Course Description

This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems.

Technical Requirements

Special software is required to use some of the files in this course: .tex, .py, .rb, and .zip.