Complexity Analysis
How much work an algorithm does as its input grows, and how that estimate picks the implementation before you measure.
How much work an algorithm does as its input grows, and how that estimate picks the implementation before you measure.
P, NP and NP-hard: what a problem class says about the algorithm you can expect.
Shortest paths and minimum spanning trees: which algorithm fits which graph, and where the complexity moves.
Quicksort, merge sort and binary search: the comparison model, stability, and when the input shape changes the right answer.