Consider the problem of making change for n cents using the fewest number of coins. Assume that
Question:
a. Describe a greedy algorithm to make change consisting of quarters, dimes, nickels, and pennies. Prove that your algorithm yields an optimal solution.
d. Give an O (nk)-time algorithm that makes change for any set of k different coin denominations, assuming that one of the coins is a penny.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Statistics Principles And Methods
ISBN: 9780470904114
7th Edition
Authors: Richard A. Johnson, Gouri K. Bhattacharyya
Question Posted: