2 ms·
Table of Contents 1. Recursion 2. Backtracking 3. Dynamic Programming 4. Greedy Algorithms 5. Basic Graph Algorithms 6. Depth-First Search
by karmakaze 3y ago
Table of Contents
1. Recursion
2. Backtracking
3. Dynamic Programming
4. Greedy Algorithms
5. Basic Graph Algorithms
6. Depth-First Search
7. Minimum Spanning Trees
8. Shortest Paths
9. All-Pairs Shortest Paths
10. Maximum Flows & Minimum Cuts
11. Applications of Flows and Cuts
12. NP-Hardness
Each chapter has more detailed subsections in the full TOC, but this gives an overall outline.
- karmakaze 3y agoWith the success of internet/search/gpt and package managers, these are the sorts of things that are good to know exist and have various space/time bounds but otherwise easy to look up. Some of the subsections and applications are probably good to see how a fundamental algorithm can be used different ways. Most of my thinking time is at a higher (not deeper) level where it's mapping a problem to selected datastructures/algorithms and program design, putting the pieces together in a manageable way.