Question

Show that if there were a coin worth 17 cents, the following greedy algorithm that uses quarters, 17-cent coins, dimes, nickels, and pennies would not always produce change using the fewest coins possible

Answer 1

12 cents, the greedy algorithm using quarters, 12-cent coins, dimes, nickels, and pennies would not always produce change using the fewest coins