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 11: Augmenting Data Structures, Dynamic Order Statistics, Interval Trees

• Lecture 12: Skip Lists

(Videos also embedded below)

Readings

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

• After Lecture 11:
  • Chapter 14
• After Lecture 12:
  • Skip Lists Handout from MIT OCW

Other material

• Optional:
  • Peteris Krumins' comments and lecture notes for Lecture 11
  • Peteris Krumins' comments and lecture notes for Lecture 12

Assignment Notes

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

Problem Set 4 is based on material from the previous 2 weeks' worth of material. It was originally due during Lecture 11, on 10/24/2005.

Videos

Lecture 11:

Lecture 12: