Remember
- Greedy takes the locally best choice and never revisits it.
- It is correct only when an exchange argument holds: any solution can be reshaped to include the greedy pick without getting worse.
- Coin change with 1, 5, 10, 25 is safe. With 1, 3, 4 and amount 6, greedy gives three coins where two suffice.