Algorithm Design Manual - Booknotes
Constant: f(n) = 1
Logarithmic: f(n) = log(n)
Linear: f(n) = n
Superlinear: f(n) = n * log(n)
Quadratic: f(n) = n^2
Cubic: f(n) = n^3
Exponential: f(n) = c^n
Factorial: f(n) = n!

Graph "Flavors"
Data Structures
Graph Traversal
Breadth-First Search
Depth-First Search
Depth-First on Directed Graphs

Minimum Spanning Trees
Shortest Paths
Network Flows - Bipartite Matching
Design Graphs, not Algorithms
Backtracking
Search Pruning
Soduku
Heuristic Search Methods
Other Methods
Parallel Algorithms

Caching vs Computation
Approximate String Matches
Longest Increasing Sequence
Partition Problem
Context-Free Grammar Parsing
Traveling Salesman Problem (TSP)