Question: 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
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.
Step by Step Solution
3.40 Rating (163 Votes )
There are 3 Steps involved in it
First give as ma... View full answer
Get step-by-step solutions from verified subject matter experts
