
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 2013" 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.
Lectures listed with a
#  DATE  TOPIC  SLIDES  FLIPPED  READINGS  DEMOS 

1  2/4  Intro · Union Find  1up · 4up  1.5  Quickfind · Quickunion  
2  2/6  Analysis of Algorithms  1up · 4up  1.4  Binary search  
3  2/11  Stacks and Queues  1up · 4up  1.3  Dijkstra 2stack  
4  2/13  Elementary Sorts  1up · 4up  2.1  Selection · Insertion · Shuffle · Graham  
5  2/18  Mergesort  1up · 4up  2.2  Merging  
6  2/20  Quicksort  1up · 4up  2.3  Partitioning · Dijkstra 3way  
7  2/25  Priority Queues  1up · 4up  1up · 4up  2.4  Heap · Heapsort 
8  2/27  Elementary Symbol Tables · BSTs  1up · 4up  1up · 4up  3.1–3.2  BST 
9  3/4  Balanced Search Trees  1up · 4up  1up · 4up  3.3  23 tree · Redblack BST 
10  3/6  Hash Tables · Searching Applications  1up · 4up  3.4–3.5  linear probing  
11  3/11  Midterm Exam  –  –  
12  3/13  Geometric Applications of BSTs  1up · 4up  –  Kd tree · Interval search tree  
13  3/25  Undirected Graphs  1up · 4up  4.1  DFS · BFS · Connected components  
14  3/27  Directed Graphs  1up · 4up  4.2  DFS · Topological sort · KosarajuSharir  
15  4/1  Minimum Spanning Trees  1up · 4up  1up · 4up  4.3  Greedy · Kruskal · Prim 
16  4/3  Shortest Paths  1up · 4up  4.4  Dijkstra · Acyclic · BellmanFord  
17  4/8  Maximum Flow  1up · 4up  1up · 4up  6.4  FordFulkerson 
18  4/10  String Sorts  1up · 4up  5.1  Keyindexed counting  
19  4/15  Tries  1up · 4up  1up · 4up  5.2  Trie · TST 
20  4/17  Substring Search  1up · 4up  5.3  KMP · KMP Construction  
21  4/22  Regular Expressions  1up · 4up  1up · 4up  5.4  NFA simulation · NFA construction 
22  4/24  Data Compression  1up · 4up  5.5  Huffman · LZW  
23  4/29  Beyond Polynomial Time Problems  1up · 4up  –  –  
24  5/1  What we've done Where we're going 
1up · 4up  –  –  
CONGRATURATION THIS STORY IS HAPPY END. THANK YOU. 
Advice.
In general, slides are intended for the lecture presentations and do not provide thorough descriptions of the material alone;
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 and textbook.