Consider the problem of making change for n cents using the fewest number of coins. Assume that each coin's value is an integer. a. Describe a greedy algorithm to make change consisting of quarters, dimes, nickels, and pennies. Prove that your algorithm yields an optimal solution. b. Suppose that the available coins are in the denominations that are powers of c, i. e., the denominations are c0, c1, ..., ck for some integers c > 1 and k % 1. Show that the greedy algorithm always yields an optimal solution. c. Give a set of coin denominations for which the greedy algorithm does not yield an optimal solution. Your set should include a penny so that there is a solution for every value of n. 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.
Answers (1)
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “Consider the problem of making change for n cents using the fewest number of coins. Assume that each coin's value is an integer. a. ...” in 📗 Computers & Technology 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
You Might be Interested in
In the given switch statement, what will be displayed if the value of var is 3? switch (var) { case 1: System. out. println ("Apple"); break; case 2: System. out. println ("Banana"); break; case 3: System. out. println ("Peach"); case 4: System. out.
Answers (1)
Suppose you enter 34.3, the ENTER key, 57.8, the ENTER key. Analyze the following code. 1 Scanner input = new Scanner (System. in); 2 double v1 = input. nextDouble (); 3 double v2 = input. nextDouble (); 4 String line = input.
Answers (1)
What is one of the problems with project managementsoftware? The project manager manages the software instead of theproject Project duration calculations are sometimesapproximate You cannot override the project management softwaredecisions regarding
Answers (1)
In a system using the fixed partitions memory allocation scheme, given the following situation (and using decimal form) : After Job J is loaded into a partition of size 50K, the resulting fragmentation is 7168 bytes.
Answers (2)
Write a method named pay that accepts two parameters: a real number for a TA's salary, and an integer for the number of hours the TA worked this week. The method should return how much money to pay the TA. For example, the call pay (5.
Answers (1)
New Questions in Computers & Technology
The next generation ip version and successor to ipv4 is called what? ipv5 ipv6 iana ssl
Answers (1)
Needed urgently what are short cut keys
Answers (2)
To ignore all tracked changes in a document you should select the
Answers (1)
Windows live skydrive is an example of what storage
Answers (1)
A variable must have its type declared but it is not required to be initialized prior to first use. a) TRUE b) FALSE
Answers (1)