Question
2. (10 points) Show that if there were a coin worth 9 cents, the greedy algorithm using quarters, dimes, 9-cent coins, nickels, and pennies would
2. (10 points) Show that if there were a coin worth 9 cents, the greedy algorithm using quarters, dimes, 9-cent coins, nickels, and pennies would not always produce change using the fewest coins possible. Note: for full credit, you need to find an example where the greedy algorithm does not produce change using the fewest coins possible, and then describe why this example works: trace the greedy algorithm to explain how many coins it would produce in change? whats a better way to make change using fewer coins? Second note: for worked examples related to this question, refer to Week 1 discussion section worksheet
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started