1 paper
Cornelia A. Van Cott, Qiyu Zhang
The change-making problem asks: given a positive integer v and a collection C of integer coin values c1=1<c2<c3<⋯<cn, what is the minimum number of coins needed t…