Definition:Greedy Algorithm

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.

This article is complete as far as it goes, but it could do with expansion. In particular: This could be expanded and made less woolly. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding this information. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Expand}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.

Also see

• Results about greedy algorithms can be found here.

Sources

• 1989: Ephraim J. Borowski and Jonathan M. Borwein: Dictionary of Mathematics ... (previous) ... (next): greedy algorithm