Algorithmic Solution of the Change-Making Problem
- 1 January 1970
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 17 (1) , 113-122
- https://doi.org/10.1145/321556.321567
Abstract
The change-making problem (assemble a total of C cents using the least number of coins) is representative of a frequently encountered class of optimization problems. A re- cursive algorithm is developed for solving that problem. A much simpler--but not universally applicable--algo rithm is also presented, and a procedure is described for testing its validity for any specified set of parameters.Keywords
This publication has 0 references indexed in Scilit: