Greedy: Activities, Knapsack, Jobs
The greedy-choice property and optimal substructure, with the exchange argument used to prove a greedy rule; activity selection by earliest finish with a full trace and the rules that fail (shortest first, earliest start) shown by counterexamples; fractional knapsack by value per weight and why the same rule fails for 0/1 knapsack; job sequencing with deadlines and unit times using the latest free slot; coin systems where greedy change is and is not optimal. Every greedy answer is compared with brute force by script.
