Greedy Algorithms8 sections · 316 units
Open in Course

Common Proof Mistakes

Avoid these errors

Watch out for these mistakes when proving greedy correctness:

1.1. Assuming greedy is optimal without proof: : "It seems like it should work" is not a proof.

2.2. Proving greedy is good, not optimal: : Showing greedy gives a valid solution is not enough. You must show it is as good as any other.

3.3. Incomplete exchange: : Forgetting to show the swap maintains validity (not just quality).

4.4. Wrong measure for stays ahead: : The measure must be comparable at every step.