Greedy Algorithms

Greedy Algorithms build a solution by making the best local choice at each step.

Key Ideas

• Prove a greedy choice works (exchange argument / invariant).
• Often paired with sorting.
• Common patterns: interval scheduling, reachability, locally optimal updates.