Tu 1/30 Introduction (1.2 - 1.4)
Th 2/1 Order & Summations (2.1 - 3.2)
Tu 2/6 Recurrences (4.1 - 4.2)
Th 2/8 The Master Theorem (4.3)
Tu 2/13 Heaps (7.1 - 7.5)
Th 2/15 Quicksort, Radix Sort (8.1 - 8.4, 9.1 - 9.4)
Tu 2/20 Linear Time Selection (10.1 - 10.2)
Th 2/22 Linear Time Selection (10.3)
Tu 2/27 Exam 1
Th 2/29 Sets and Hashing (11.1 - 12.4)
Tu 3/5 Red-Black Trees (13.1 - 13.3, 14.1)
Th 3/7 More Red-Black Trees (14.2 - 14.4)
Tu 3/12 Dynamic Programming (16.1 - 16.2)
Th 3/14 Dynamic Programming (16.3 - 16.4)
Spring break
Tu 3/26 Disjoint Set Union (22.1 - 22.3)
Th 3/28 Graph Search (23.1 - 23.3)
Tu 4/2 Topological Sort (23.4)
Th 4/4 Strongly Connected (23.5)
Tu 4/9 Minimum Spanning Tree (24.1 - 24.2)
Th 4/11 Single Source Shortest Path (25.1 - 25.2)
Tu 4/16 More SSSP (25.3 - 25.4)
Th 4/18 All Pairs Shortest Path (26.1 - 26.2)
Tu 4/23 Exam 2
Th 4/25 Network Flow (27.1)
Tu 4/30 More Network Flow (27.2)
Th 5/2 Even more Network Flow (27.3)
Tu 5/7 Advanced Topic TBA
Th 5/9 Advanced Topic TBA
Tu 5/14 Final exam, 6:00pm - 8:00pm