next up previous
Next: Proving Greedy Algorithms Optimal Up: CSE 2320: Algorithms and Previous: CSE 2320: Algorithms and

Greedy Algorithms

Recall that Dynamic Programming consists of two parts:


Greedy Programming also consists of two parts:

A globally-optimal solution can be obtained by making a locally-optimal (greedy) choice. In other words, the globally optimal solution does not depend on the solution to its subproblems.

A Greedy Algorithm starts with a locally-optimal choice, and continues making locally-optimal choices until a solution is found.

Copyright © 1998 The University of Texas at Arlington