Optimal Bounds for the Change -


The change-making problem is the problem of representing a given value with the fewest coins possible. We investigate the problem of determining whether the greedy algorithm produces an optimal representation of all amounts for a given set of coin denominations 1 = c1 < c2 < < cm. Chang and Gill 1] show that if the greedy algorithm is not always optimal… (More)