Category:Greedy Algorithms
Jump to navigation
Jump to search
This category contains results about Greedy Algorithms.
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.
Subcategories
This category has only the following subcategory.
F
- Fibonacci's Greedy Algorithm (5 P)
Pages in category "Greedy Algorithms"
The following 5 pages are in this category, out of 5 total.