Introduction to Algorithms

Lecture Videos

Due to COVID-19, in-person classes were suspended mid-way through the semester. Lectures continued to be recorded in a traditional style.

Lecture 1: Algorithms and Computation

Lecture 2: Data Structures and Dynamic Arrays

Problem Session 1

Lecture 3: Sets and Sorting

Lecture 4: Hashing

Problem Session 2

Lecture 5: Linear Sorting

Problem Session 3

Lecture 6: Binary Trees, Part 1

Lecture 7: Binary Trees, Part 2: AVL

Problem Session 4

Lecture 8: Binary Heaps

Lecture 9: Breadth-First Search

Quiz 1 Review

Lecture 10: Depth-First Search

Lecture 11: Weighted Shortest Paths

Problem Session 5

Lecture 12: Bellman-Ford

Problem Session 6

Lecture 13: Dijkstra

Problem Session 7

Lecture 14: APSP and Johnson

Quiz 2 Review

Lecture 15: Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling

Lecture 16: Dynamic Programming, Part 2: LCS, LIS, Coins

Problem Session 8

Lecture 17: Dynamic Programming, Part 3: APSP, Parens, Piano

Lecture 18: Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial

Lecture 19: Complexity

Quiz 3 Review

Lecture 20: Course Review

Lecture 21: Algorithms—Next Steps