Introduction to Algorithms (MIT 6.046J)

Lectures

Lecture links to the MIT OCW site include the video or audio lecture itself in several formats, along with a transcript and a PDF set of lecture notes.

• Lecture 2: Asymptotic Notation - Recurrences - Substitution, Master Method

• Lecture 3: Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication

(Videos are also embedded below)

Readings

All readings, unless otherwise specified, are from Introduction to Algorithms, 2nd Edition.

• After Lecture 2:
  • Chapters 3 - 4, excluding section 4.4
• After Lecture 3:
  • Sections 28.2, 30.1

Other material

• Optional:
  • Peteris Krumins' comments and lecture notes for Lectures 1 and 2 (only the portion on Lecture 2 is relevant to this week's lesson)
  • Peteris Krumins' comments and lecture notes for Lecture 3

Assignment Notes

Assignments are listed under the Curious Reef "lesson" containing the lecture on which they were due, rather than the lesson containing the lecture when they were assigned.

The first problem set relies on material from last week and this week, but is not due until next week. Feel free to take a look at next week's lesson to get started!

Videos

Lecture 2:

Lecture 3: