Algorithmic Solution of the Change-Making Problem
S. K. Chang, Anmol Singh Gill · Journal of the ACM · 1970
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 recursive algorithm is developed for solving that problem.A much simpler--but not universally applicable--algorithm is also presented, and a procedure is described for testing its validity for any specified set of parameters.