6.006: Introduction to Algorithms

• Lecture 1 – Introduction & Document Distance (1 Feb 2011)
  notes | code | data | recitation notes | readings: 1, 3, D.1
• Lecture 2 – Peak Finding (3 Feb 2011)
  notes | recitation notes | readings: 4.1, 4.3, D.1

• Lecture 3 – Binary Search Trees (8 Feb 2011)
  notes | recitation notes | readings: 10.4, 12.1, 12.2, 12.3
• Lecture 4 – AVL Trees (10 Feb 2011)
  notes | code | recitation notes | readings: 13.2, 14

• Lecture 5 – Hashing I (15 Feb 2011)
  notes | recitation notes | readings: 11
• Lecture 6 – Hashing II (17 Feb 2011)
  notes | recitation notes | readings: 11
• Lecture 7 – Hashing III (24 Feb 2011)
  notes | recitation notes | readings: 11

• Lecture 8 – Sorting I (1 Mar 2011)
  notes | recitation notes | readings: 1.2, 2.1-2.3, 4.3-4.6
• Lecture 9 – Sorting II (3 Mar 2011)
  notes | recitation notes | readings 6.1-6.4
• Lecture 10 – Sorting III (8 Mar 2011)
  notes | no recitation | readings 8.1-8.3

• Lecture 11 – Searching I (10 Mar 2011)
  notes | recitation notes | readings: 22.1-22.3, B.4
• Lecture 12 – Searching II (15 Mar 2011)
  notes | recitation notes | readings: 22.2-22.3
• Lecture 13 – Searching III (18 Mar 2011)
  notes | recitation notes | readings: 22.4-22.5

• Lecture 14 – Shortest Paths I: Intro (29 Mar 2011)
  notes | recitation notes | readings: 24.0
• Lecture 15 – Shortest Paths II: Bellman-Ford (31 Mar 2011)
  notes | recitation notes | readings: 24.1-24.2
• Lecture 16 – Shortest Paths III: Dijkstra (5 Apr 2011)
  notes | recitation notes | readings: 24.3
• Lecture 17 – Shortest Paths IV: Applications (7 Apr 2011)
  notes | recitation notes | readings: 24.4

• Lecture 18 – Dynamic Programming I: Fibonacci, Crazy Eights, sequence alignment (12 Apr 2011)
  notes | substring matching | no recitation | readings: 15.3-15.4
• Lecture 19 – Dynamic Programming II: more sequence alignment, all-pairs shortest paths (14 Apr 2011)
  notes | recitation notes | readings: 15.3-15.4
• Lecture 20 – Dynamic Programming III: guessing, parenthesization, knapsack, Tetris training (21 Apr 2011)
  notes | readings: 15.2-15.3
• Lecture 21 – Dynamic Programming IV: piano fingering, platform video games, structural DP, vertex cover, widget layout (26 Apr 2011)
  notes | recitation notes | readings: 15.3

• Lecture 22 – Numerics I (28 Apr 2011)
  notes | recitation notes | readings: –
• Lecture 23 – Numerics II (3 May 2011)
  notes | recitation notes | readings: –
• Lecture 24 – Geometry (5 May 2011)
  notes | recitation notes | readings: 33.1-33.3, 33.4
• Lecture 25 – Reductions and Complexity (10 May 2011)
  notes | readings: 34

• Lecture 26 – Beyond 6.006 (12 May 2011)
  notes | readings: –

Readings refer to chapters and/or sections of Introduction to Algorithms, 3rd Edition. See the table of contents.