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 1: Administrivia - Introduction - Analysis of Algorithms, Insertion Sort, Mergesort (embedded below)
  • Note: Obviously, most of the administrivia is of no use to us, since we're not taking the class at MIT. Feel free to skip to 17:15 in the video, where the real content of the lecture starts.

Readings

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

• After Lecture 1:
  • Chapters 1 - 2
• Optional:
  • Appendices A-C for supplemental math, as needed. It is suggested to at least skim the appendices.

Other material

• Optional:
  • Peteris Krumins has posted comments and lecture notes for lectures 1 and 2. For now, only read the first part. Well worth checking out!

Assignment Notes

MIT's version of this course did not follow a set schedule for assignments -- there were 15 weeks of class, plus a final exam, but only 9 assignments. This is a bit unusual, and makes it hard to fit into the Curious Reef system.

The best way I could think of to deal with this is: assignments will be 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.

This means that some weeks, including this one, will not include any assignments. In some cases, that's because the assignment relies on 2 weeks' worth of material. The first assignment is not due until the third week of class, but you will have all the background to complete it after the first lecture of next week's lesson.

Video