Definition:Greedy Algorithm

From ProofWiki
Jump to navigation Jump to search

Definition

A greedy algorithm is an algorithm whose decision strategy is such that any choice made at any stage takes no consideration of any future state.

The strategy is to make the choice which has the greatest short-term effect towards the long-term goal.

In some problems this may not produce the optimum solution.




Also see

  • Results about greedy algorithms can be found here.


Sources