6.006 | Spring 2008 | Undergraduate

Introduction to Algorithms

Lecture Notes

file
83 kB
Numerics Demo
file
7 kB
Simple Python code for graphs
pdf
188 kB
Lecture 1: Introduction and the Document Distance Problem
pdf
698 kB
Lecture 2: More on the Document Distance Problem
pdf
1 MB
Lecture 3: Scheduling and Binary Search Trees
pdf
1 MB
Lecture 4: Balanced Binary Search Trees
pdf
883 kB
Lecture 5: Hashing I: Chaining, Hash Functions
pdf
773 kB
Lecture 6: Hashing II: Table Doubling, Karp-Rabin
pdf
1 MB
Lecture 7: Hashing III: Open Addressing
pdf
1 MB
Lecture 8: Sorting I: Heaps
pdf
742 kB
Lecture 9: Sorting II: Heaps
pdf
863 kB
Lecture 10: Sorting III: Linear Bounds Linear-Time Sorting
pdf
1 MB
Lecture 11: Sorting IV: Stable Sorting, Radix Sort
pdf
2 MB
Lecture 12: Searching I: Graph Search and Representations
pdf
1 MB
Lecture 13: Searching II: Breadth-First Search and Depth-First Search
pdf
680 kB
Lecture 14: Searching III: Toplogical Sort and NP-completeness
pdf
1 MB
Lecture 15: Shortest Paths I: Intro
pdf
1 MB
Lecture 16: Shortest Paths II: Bellman-Ford
pdf
658 kB
Lecture 17: Shortest Paths III -Dijkstra and Special Cases
pdf
1 MB
Lecture 18: Shortest Paths IV - Speeding up Dijkstra
pdf
496 kB
Lecture 19: Dynamic Programming I: Memoization, Fibonacci, Crazy Eights, Guessing
pdf
519 kB
Lecture 20: Dynamic Programming II: Longest Common Subsequence, Parent Pointers
pdf
695 kB
Lecture 21: Dynamic Programming III: Text Justication, Parenthesization, Knapsack, Pseudopolynomial Time, Tetris Training
pdf
680 kB
Lecture 22: Dynamic Programming IV: Piano Fingering, Structural DP (Trees), Vertex Cover, Dominating Set, Beyond
pdf
852 kB
Lecture 23: Numerics I
pdf
171 kB
Lecture 24: Numerics II
pdf
95 kB
Lecture 25: Beyond 6.006: Follow-on Classes, Geometric Folding Algorithms

Course Info

Departments
As Taught In
Spring 2008
Level
Undergraduate
Topics
Learning Resource Types
Exam Solutions
Exams
Lecture Notes
Presentation Assignments with Examples
Problem Sets
Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2026 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2026 Massachusetts Institute of Technology