Computer Science‎ > ‎

Greedy Algorithms


Greedy Algorithm: Use a heuristic to make a locally optimum choice at every stage. This may give the global optimum in some cases or might be reasonably close to it in some cases. Sometimes, depending on the situation it might not give a solution which is close to the optimal value in any way. 


ċ
greedyKnapsack.jar
(5k)
Prashant Bhattacharji,
Aug 2, 2011, 3:12 AM
Comments