Greedy Algorithms

Repeat until problem is solved:

• Measure options according to marginal value
• Commit to maximum

Greedy algorithms are normally fast and simple.

Sometimes appropriate as a heuristic solution or to approximate the optimal solution.

Previous slide

Next slide

Back to first slide

View graphic version