1. Consider the coin-change problem: Given a set of coin types and an amount of change to be returned, determine the
fewest number of coins for this amount of change.
a) What "greedy" algorithm would you use to solve this problem with US coin types of {1, 5, 10, 25, 50} and a change
amount of 29-cents?
b) Do you get the correct solution if you use this algorithm for coin types of {1, 5, 10, 12, 25, 50} and a change
amount of 29-cents?
2. One way to solve this problem in general is to use a divide-and-conquer algorithm. Recall the idea of
Divide-and-Conquer algorithms.
Solve a problem by:
dividing it into smaller problem(s) of the same kind
solving the smaller problem(s) recursively
use the solution(s) to the smaller problem(s) to solve the original problem
a) For the coin-change problem, what determines the size of the problem?
b) How could we divide the coin-change problem for 29-cents into smaller problems?
c) If we knew the solution to these smaller problems, how would be able to solve the original problem?
Data Structures (CS 1520) Lecture 10 Name:_________________
L
ecture 10
- Page
1
Docsity.com
