The change-making problem addresses the following question: how can a given amount of money be made with the least number of coins of given denominations? The class gives two implementations: an iterative one and a recursive one. @author FLAG
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected