Ask Question
15 March, 19:41

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

+4
Answers (1)
  1. 15 March, 22:17
    0
    12 cents, the greedy algorithm using quarters, 12-cent coins, dimes, nickels, and pennies would not always produce change using the fewest coins
Know the Answer?
Not Sure About the Answer?
Get an answer to your question ✅ “Show that if there were a coin worth 17 cents, the following greedy algorithm that uses quarters, 17-cent coins, dimes, nickels, and ...” in 📙 Mathematics if there is no answer or all answers are wrong, use a search bar and try to find the answer among similar questions.
Search for Other Answers