
Lecture 12 of 32 · Introduction to Algorithms
Erik Demaine, Jason Ku and Justin Solomon
Introduction to Algorithms · 32 lectures
32 lectures
Algorithms and Computation
Data Structures and Dynamic Arrays
Problem Session 1: Asymptotic Behavior of Functions
Sets and Sorting
Hashing
Problem Session 2 (, )
Linear Sorting
Problem Session 3
Binary Trees, Part 1
Binary Trees, Part 2: AVL
Problem Session 4
Binary Heaps
Breadth-First Search
Quiz 1 review
Depth-First Search
Weighted Shortest Paths
Problem Session 5
Bellman-Ford
Dijkstra
Problem Session 7
APSP and Johnson
Quiz 2 Review
Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling
Dynamic Programming, Part 2: LCS, LIS, Coins
Problem Session 8
Dynamic Programming, Part 3: APSP, Parens, Piano
Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial
Complexity
Problem Session 9
Quiz 3 Review
Course Review
Algorithms—Next Steps