Module
Greedy Design and Proof Techniques
Sign in to add this module to your path and practice.
About
Formulating greedy algorithms for scheduling and selection problems; exchange arguments and greedy-stays-ahead proofs.
Goal
For classic interval and selection problems, state the greedy rule, prove it yields an optimal solution, and analyze running time.
Unlocks
Tutor
Ask questions about this module.
Hi — I'm your tutor for Greedy Design and Proof Techniques. Ask about the concepts, goal, or where you're stuck.