Introduction to Algorithms

CSE 421 | Winter 2026

Lecture and section material†

 

• Lecture 1 (Jan 05): Thinking like a computer scientist (pdf)
• Lecture 2 (Jan 07): Writing algorithms and graph traversal (pdf, KT: 3-3.6, DPV: 4.2-4.3)
• Lecture 3 (Jan 09): Graph traversal, DFS, BFS, applications (pdf)
• Lecture 4 (Jan 12): Directed graphs and greedy algorithms (pdf, KT: 4-4.2, DPV: 5-5.1)
• Lecture 5 (Jan 14): Greedy approximation and graph algorithms (pdf), KT: 12.4,4.4-4.7, DPV: 4.4-4.7)
• Lecture 6 (Jan 16): More greedy algorithms (pdf)
• No lecture Jan 19
• Lecture 7 (Jan 21): Minimum spanning trees (pdf, KT: 5-5.4, DPV: 2.2-2.4)
• Lecture 8 (Jan 23): Divide and conquer (pdf)
• Lecture 9 (Jan 26): Multiplication algorithms (pdf, KT: 5.5-5.6, DPV: 2.5-2.6)
• Lecture 10 (Jan 28): Derandomization, quick sort, and stable matching I (pdf, KT: 13.5, DPV: 2.4)
• Lecture 11 (Jan 30): Stable matching II and midterm review (pdf, review, KT: 1)
• No lecture Feb 2
• Lecture 12 (Feb 04): Dynamic programming I (pdf)
• Lecture 13 (Feb 06): Dynamic programming II (pdf, KT: 6,6.2,6.6, DPV 6.3)
• Lecture 14 (Feb 09): Dyanmic programming III (pdf, KT: 6.4, 11.8, DPV 6.4)
• Lecture 15 (Feb 11): Dyanmic programming IV (pdf)
• Lecture 16 (Feb 13): Network Flow (pdf, KT: 7-7.2)
• Lecture 17 (Feb 18): Max Flow/Min Cut (pdf, KT: 7-7.2)

• Section 1 (Jan 08): (pdf)
• Section 2 (Jan 15): (pdf)
• Section 3 (Jan 22): (pdf)
• Section 4 (Jan 29): (pdf)
• Section 5 (Feb 05): (No worksheet. Section will be a midterm/early pset postmortem)
• Section 6 (Feb 09): (pdf)

^{†. Course schedule and contents subject to change and will be announced throughout the term.↩}