Prove or disprove that the greedy algorithm for making change always uses the fewest coins possible when the
denominations available are pennies (1-cent coins), nickels (5-cent coins), and quarters (25-cent coins).

Name: Prove or disprove that the greedy algorithm for making change always uses the fewest coins possible when the denominations available are pennies (1-cent coins), nickels (5-cent coins), and quarters (25-cent coins).
Brand: Quizplus
Rating: 4.9 (33 reviews)

Question

Quizplus · Accepted Answer

Note that each denomination divides the next largest one.

Prove or Disprove That the Greedy Algorithm for Making Change