
Computer Science 226 
Below are links to the lecture slides. Once the lecture moves above the "Lectures below have not yet been updated for Spring 2011" part of the table, no significant changes will be made. All readings refer to Algorithms, 4th edition by R. Sedgewick and K. Wayne unless otherwise specified.
#  DATE  TOPIC  SLIDES  READINGS  DEMOS 

1  1/31  Intro · Union Find  1up · 4up  Algs 4 PE, Section 1.5  – 
2  2/2  Analysis of Algorithms (new 2/2)  1up · 4up  Algs 4, Section 1.4  – 
3  2/7  Stacks and Queues (new 2/6)  1up · 4up  Intro to Programming, 4.3  – 
4  2/9  Elementary Sorts  1up · 4up  2.1  sorting animations 
5  2/14  Mergesort  1up · 4up  2.2  sorting animations 
6  2/16  Quicksort  1up · 4up  2.3  partitioning 
7  2/21  Priority Queues  1up · 4up  2.4  – 
8  2/23  Elementary Symbol Tables · BSTs  1up · 4up  3.1–3.2  GrowingTree 
9  2/28  Balanced Search Trees  1up · 4up  3.3  GrowingTree 
10  3/2  Hash Tables and Searching Applications (new 3/1)  1up · 4up  3.4  – 
11  3/7  Midterm Exam  –  –  
12  3/9  Undirected Graphs  1up · 4up  4.1  DFS · BFS 
13  3/21  Directed Graphs  1up · 4up  4.2  DFS · topological sort 
14  3/23  Minimum Spanning Trees  1up · 4up  4.3  – 
15  3/28  Shortest Paths  1up · 4up  4.4  Dijkstra 
16  3/30  String Sorts  1up · 4up  5.1  string sorts 
17  4/4  Tries  1up · 4up  5.2  – 
18  4/6  Substring Search (new 4/5)  1up · 4up  5.3  substring search · DFA · KMP 
19  4/11  Regular Expressions (new 4/11)  1up · 4up  5.4  – 
20  4/13  Data Compression  1up · 4up  5.5  – 
21  4/18  Maxflow  1up · 4up  6 (pages 886902)  – 
22  4/20  Linear Programming  1up · 4up  LP article  – 
23  4/25  Reductions/Intractability  1up · 4up  6 (pages 903921)  – 
24  4/27  Combinatorial Search  1up · 4up  –  The Longest Path [mp3] 
Advice.
The slides are intended for the lecture presentations;
for reference, read the indicated sections from
Algorithms, 4th edition.
An effective strategy
is to skim the textbook before the lecture, then read it thoroughly
soon afterwards.
We recommend printing the slides before lecture and
annotating them during lecture.
Online viewing and printing. These lecture slides are suitable for online viewing (one per page) or printing (four per page).
Errata. Here is a list of known errors in the lecture slides.