Definition:Greedy Algorithm
From ProofWiki
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 could be expanded and made less woolly.
You can help Proof Wiki by expanding it.
To discuss it in more detail, feel free to use the talk page.
When this page/section has been completed, {{Stub}} should be removed from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
