Proof of Correctness

Common technique for proving correctness of greedy algorithms is by contradiction:

• assume there is a non-greedy best way
• show that making that way more like greedy solution improves the supposedly best way: contradiction!

Proof of correctness for greedy scheduling:

Previous slide

Next slide

Back to first slide

View graphic version