JHU 601.433/633 Introduction to Algorithms, Fall 2025

Tentative Schedule

This schedule is very preliminary: the number of lectures and order of the topics are likely to change.

Lec.	Date	Day	Topic	Assignments
1	Aug 26	T	Introduction, Karatsuba/Strassen [Lecture Notes \| CLRS 1, 2, 4.2] [Dinitz slides \| Dinitz annotated slides \| Dinitz video] [Sorrell slides \| Sorrell video]
2	Aug 28	Th	Asymptotic analysis, recurrences [Lecture Notes \| CLRS 3, 4] [Dinitz slides \| Dinitz annotated slides \| Dinitz video] [Sorrell Slides]
3	Sep 2	T	Intro to proofs for algorithms [Dinitz slides] [Sorrell slides \| Sorrell annotated slides \| Sorrell video]	Quiz 1, HW 1 out
4	Sep 4	Th	Probabilistic analysis, randomized quicksort [Lecture Notes \| CLRS 5, 7, Appendix C] [Dinitz slides \| Dinitz annotated slides \| Dinitz video] [Sorrell slides \| Sorrell video]
5	Sep 9	T	Linear time selection/median [Lecture Notes \| CLRS 9] [Dinitz slides \| Dinitz annotated slides \| Dinitz video] [Sorrell slides \| Sorrell annotated slides \| Sorrell video]	Quiz 2
6	Sep 11	Th	Sorting: O(n) algorithms and Ω(n log n) lower bound [Lecture Notes \| CLRS 8] [Dinitz slides \| Dinitz annotated slides \| Dinitz video] [Sorrell slides \| Sorrell annotated slides \| Sorrell video]
7	Sep 16	T	Balanced Search Trees [Lecture Notes \| CLRS 12, 13, 18] [Dinitz slides \| Dinitz annotated slides \| Dinitz video] [Sorrell slides \| Sorrell annotated slides \| Sorrell video]	Quiz 3, HW 1 due, HW2 out
8	Sep 18	Th	Amortized Analysis [Lecture Notes \| CLRS 17] [Dinitz slides \| Dinitz annotated slides \| Dinitz video] [Sorrell slides \| Sorrell annotated slides \| Sorrell video]
9	Sep 23	T	Heaps [Lecture Notes \| CLRS 6 \| Slides from Kevin Wayne] [Dinitz slides \| Dinitz annotated slides \| Dinitz video] [Sorrell slides \| Sorrell annotated slides \| Sorrell video]	Quiz 4
10	Sep 25	Th	Union-Find [Lecture Notes \| CLRS 21] [Dinitz slides \| Dinitz annotated slides \| Dinitz video] [Sorrell slides \| Sorrell annotated slides \| Sorrell video]
11	Sep 30	T	Universal and Perfect Hashing [Lecture Notes \| CLRS 11] [Dinitz slides \| Dinitz annotated slides \| Dinitz video] [Sorrell slides \| Sorrell annotated slides \| Sorrell video]	Quiz 5, HW2 due, HW3 out
	Oct 1	W	Recitation 5 [Recording]
12	Oct 2	Th	Dynamic Programming I [Lecture Notes \| CLRS 15] [Dinitz slides]
13	Oct 7	T	Dynamic Programming II [CLRS 15]	Quiz 6
14	Oct 9	Th	Basic Graph Algorithms I [CLRS 22]
15	Oct 14	T	Basic Graph Algorithms II [CLRS 22]	Quiz 7, HW3 due
	Oct 16	Th	No Class: Fall break
	Oct 21	T	Midterm Exam	HW4 out
16	Oct 23	Th	Single-Source Shortest Paths [CLRS 24]
17	Oct 28	T	All-Pairs Shortest Paths [CLRS 25]	Quiz 8
18	Oct 30	Th	Minimum Spanning Trees [CLRS 23]
19	Nov 4	T	Matroids and Greedy Algorithms [CLRS 16.4]	Quiz 9, HW4 due, HW5 out
20	Nov 6	Th	Max-Flow Min-Cut [CLRS 26.1 - 26.3]
21	Nov 11	T	Max-Flow II: Bipartite Matching, Edmonds-Karp [CLRS 26.1 - 26.3]	Quiz 10
22	Nov 13	Th	Linear Programming [CLRS 29.1, 29.2]
23	Nov 18	T	NP-Completeness I [CLRS 34]	Quiz 11, HW5 due, HW6 out
24	Nov 20	Th	NP-Completeness II [CLRS 34]
	Nov 25	T	No Class: Thanksgiving break
	Nov 27	Th	No Class: Thanksgiving break
25	Dec 2	T	Advanced Topics I	Quiz 12
26	Dec 4	Th	Advanced Topics II	HW6 due
	TBD		Final Exam