6.006: Introduction to Algorithms

Below are materials and information relevant to 6.006 lectures, recitations, and quizzes. These materials will be updated as term progresses.

Lecture and recitation notes are posted on the class wiki.

September
Thu	Sep 10	Lecture 1: Introduction, Document Distance Document Distance Example Readings: CLRS, chapters 1, 2, 3.
Fri	Sep 11	Recitation 1: Asymptotic Complexity
Tue	Sep 15	Lecture 2: Divide-and-Conquer, Peak Finding Problem Readings: CLRS, chapter 4	PS1 Out
Wed	Sep 16	Recitation 2: Peak Finder
Thu	Sep 17	Lecture 3: Binary Search Trees, Scheduling Problem Readings: CLRS, chapter 12
Fri	Sep 18	Recitation 3: Binary Search Trees
Tue	Sep 22	Lecture 4: AVL Trees	PS1-A Due
Wed	Sep 23	Recitation 4
Thu	Sep 24	Lecture 5: Hashing1: Chaining, Hash Functions	PS1-B Due PS2 Out
Fri	Sep 25	Recitation 5
Tue	Sep 29	Lecture 6
Wed	Sep 30	Recitation 6
October
Thu	Oct 1	Lecture 7
Fri	Oct 2	Recitation 7