Algorithmic Solution of the Change-Making Problem

The change-making problem (assemble a to ta l of C cents using the least number of coins) is r epresen ta t ive of a f requent ly encountered class of opt imizat ion problems. A recursive a lgor i thm is developed for solving t h a t problem. A much s imp le r -bu t not universal ly appl icable-a lgor i thm is also presented, and a procedure is described for t e s t ing its va l id i ty for any specified set of parameters .