Introduction to Algorithms

Lecture Notes

LEC #	TOPICS
Unit 1: Introduction
1	Algorithmic thinking, peak finding (PDF - 1.9MB)
2	Models of computation, document distance Original (handwritten) notes (PDF - 5.2MB) Typed notes (PDF) Lecture code (ZIP) (This ZIP file contains: 8 .py files.)
Unit 2: Sorting and Trees
3	Insertion sort, merge sort (PDF) (Courtesy of Charles Leiserson, Piotr Indyk, Constantinos Daskalakis, and Srini Devadas. Used with permission.)
4	Heaps and heap sort (PDF) (Courtesy of Charles Leiserson, Piotr Indyk, Constantinos Daskalakis, and Srini Devadas. Used with permission.)
5	Binary search trees, BST sort (PDF - 1.2MB)
6	AVL trees, AVL sort Original (handwritten) notes (PDF - 3.9MB) Typed notes (PDF - 1.4MB) Lecture code (ZIP) (This ZIP file contains: 2 .py files and 1 .txt file.)
7	Counting sort, radix sort, lower bounds for sorting Original (handwritten) notes (PDF - 3.1MB) Typed notes (PDF)
Unit 3: Hashing
8	Hashing with chaining Original (handwritten) notes (PDF - 4.3MB) Typed notes (PDF)
9	Table doubling, Karp-Rabin Original (handwritten) notes (PDF - 3.7MB) Typed notes (PDF)
10	Open addressing, cryptographic hashing (PDF)
Unit 4: Numerics
11	Integer arithmetic, Karatsuba multiplication (PDF)
12	Square roots, Newton’s method (PDF)
Unit 5: Graphs
13	Breadth-first search (BFS) Original (handwritten) notes (PDF - 3.8MB) Typed notes (PDF - 1.5MB)
14	Depth-first search (DFS), topological sorting Original (handwritten) notes (PDF - 3.1MB) Typed notes (PDF - 1.6MB)
Unit 6: Shortest Paths
15	Single-source shortest paths problem (PDF)
16	Dijkstra (PDF)
17	Bellman-Ford (PDF - 1.2MB)
18	Speeding up Dijkstra (PDF - 1.1MB)
Unit 7: Dynamic Programming
19	Dynamic programming I: Fibonacci, shortest paths Original (handwritten) notes (PDF - 3.8MB) Typed notes (PDF - 1.1MB)
20	Dynamic programming II: text justification, blackjack Original (handwritten) notes (PDF - 4.0MB) Typed notes (PDF)
21	Dynamic programming III: parenthesization, edit distance, knapsack Original (handwritten) notes (PDF - 4.2MB) Typed notes (PDF)
22	Dynamic programming IV: guitar fingering, Tetris, Super Mario Bros. Original (handwritten) notes (PDF - 4.4MB) Typed notes (PDF)
Unit 8: Advanced Topics
23	Computational complexity Original (handwritten) notes (PDF - 3.9MB) Typed notes (PDF)
24	Topics in algorithms research Original (handwritten) notes for second half of class (PDF - 4.4MB) Typed notes (PDF - 1.8MB)