+1 (218) 451-4151
glass
pen
clip
papers
heaphones

1. Describe an efficient greedy algorithm for making change for a specified value using a minimum…

1. Describe an efficient greedy algorithm for making change for a specified value using a minimum…

1. Describe an efficient greedy algorithm for making change for a specified value using a minimum number of coins, assuming there are four denominations of coins (called quarters, dimes, nickels, and pennies), with values 25, 10, 5, and 1, respectively. Argue why your algorithm is correct.2. Give an example set of denominations of coins so that a greedy change-making algorithm will not use the minimum number of coins.