Rotation of a binary search tree, from the Recitation #4 slides. (Figure courtesy of Victor Costan.)
Prof. Erik Demaine
Prof. Ronald Rivest
Prof. Srinivas Devadas
6.006
Spring 2008
Undergraduate
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.