
Computer Science 226 
#  LECTURE NOTES  CHAPTER  BOOKSITE  DEMOS 

0  Overview  
1  Unionfind  1  5.3  
2  Stacks and queues  34  2.6  
3  Analysis of algorithms  2  
Elementary sorts  6  3.1  
4  Efficient sorts  78  3.2 3.3  merging partitioning 
5  Advanced topics in sorting  8  3.5  3way 
6  Priority queues  9  3.4  
7  Symbol Tables  12  4.1  
8  Binary Search Trees  12, 13  4.3  
9  Balanced BSTs  13  4.4  Growing Tree Tool 
10  Hashing  14  4.2  
11  Radix sorts  10  6.1  
12  Midterm  
13  Tries  15  6.2  
14  String searching*  19*  6.3  DFA KMP 
15  Data compression  22*  6.5  Huffman* LZW* 
16  Geometric algorithms*  2425*  7.1 7.2 7.5  convex hulls Voronoi 
17  Geometric search  2627*  7.3 7.4  sweep line intersection applications 
18  Undirected graphs  1718  5.1  DFS BFS Euler maze 
19  Minimum spanning trees  20  5.4  Graph applet applications 
20  Directed graphs  19  5.2  DFS topological sort PERT 
21  Shortest paths  21  5.5  Dijkstra 
22  Linear programming  article  8.4  
23  Reductions    8.5  
24  Combinatorial search    8.7  The Longest Path [mp3] 