CSE 421: "Introduction to Algorithms" (Autumn 2025)
CSE 421: "Introduction to Algorithms" (Autumn 2025)
*The lecture and section material below is based heavily on previous CSE 421 iterations by Robbie Weber and Chinmay Nirkhe.
*Slides were created in keynote (and are best viewed in that format). The converted ppt file has occasional formatting issues.
Lectures
09/24: Logistics; stable matchings (slides: keynote, ppt, pdf)
09/26: More stable matchings (slides: keynote, ppt, pdf)
09/29: Graph traversal; Breadth-First Search (slides: keynote, ppt, pdf)
10/01: BFS, DFS, and applications (bipartiteness testing) (slides: keynote, ppt, pdf)
10/03: DFS and applications (cycle detection, topological sorting) (slides: keynote, ppt, pdf)
10/06: Graph modeling; Greedy algorithms (intro and interval scheduling) (slides: keynote, ppt, pdf)
10/08: Greedy graph algorithms (minimum spanning trees) (slides: keynote, ppt, pdf)
10/10: Greedy graph approximation algorithms (max cut) (slides: keynote, ppt, pdf)
10/13: Divide and Conquer (mergesort, 2D closest pair)(slides: keynote, ppt, pdf)
10/15: Divide and Conquer (runtimes, Strassen's matrix multiplication) (slides: keynote, ppt, pdf)
10/17: Divide and Conquer (Karatsuba's integer multiplication, median finding) (slides: keynote, ppt, pdf)
10/20: (slides: pdf)