1.1 Pushdown stack (resizing array)
1.2 Pushdown stack (linked-list)
Quicksort with 3-way partitioning
3.5 Hashing with separate chaining
3.6 Hashing with linear probing
4.6 Strong components (Kosaraju-Sharir)
4.7 Minimum spanning tree (Prim)
4.8 Minimum spanning tree (Kruskal)
4.11 Shortest paths (Bellman-Ford)
5.3 Three-way string quicksort
5.6 Substring search (Knuth-Morris-Pratt)
5.7 Substring search (Boyer-Moore)
5.8 Substring search (Rabin-Karp)
5.9 Regular expression pattern matching