- sort: Chapter 4 Divide-and-conquer, Chapter 6 Heapsort, Chapter 7 Quicksort, Chapter 8 Sort in linear time
- element_ds: Chapter 10 Elementary Data Structure (Stack, Queue, LinkedList)
- trees: Chapter 12 Binary Search Trees, 13 Red-Black Trees
- dp: Chapter 15 Dynamic programming
- greedy: Chapter 16 Greedy Algorithms
- graph: Chapter 22 Elementary Graph Algorithms (BFS, shortest path, DFS, topological sort, strongly connected components); Chapter 23 Minimum Spanning Tree (Kruskal, Prim), Chapter 24 Single source shortest paths (Bellman-Ford, DAG topologic Sort, Dijkstra)
- string matching: Chapter 32
The implementation is tested by CxxTest framework. Run python runtests.py to test the implementation.