Ask Question
14 November, 15:40

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

+2
Answers (1)
  1. 14 November, 16:09
    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?
Find 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 the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers