Computing, Math, a EngineeringA greedy algorithm arrives at a solution by making a sequence of choices, each of which simply looks the best at the moment. ... Next he sees if adding this coin to the change would make the total value of the change exceed the amount owed .
|Title||:||Foundations of Algorithms Using Java Pseudocode|
|Author||:||Richard E. Neapolitan, Kumarss Naimipour|
|Publisher||:||Jones & Bartlett Learning - 2004|