May 2017
Intermediate to advanced
310 pages
8h 5m
English
As we said earlier, greedy algorithms make decisions that yield the largest benefit in the interim. It is the hope of this technique that by making these high yielding benefit choices, the total path will lead to an overall good solution or end.
Examples of greedy algorithms include Prim's algorithm for finding the minimum spanning trees, the Knapsack problem, and the Travelling Salesman problem, just to mention a few.
Read now
Unlock full access