Greedy Algorithms — Locally Optimal, Sometimes Globally Optimal

When taking the best choice at each step provably gives the best overall answer — activity selection, job sequencing, fractional knapsack.