Question: Modified knapsack-problem: There are coins of value 1, 5, 8, and 14 cents and weights 1, 1.5, 2, and 4 grams, respectively. Design an algorithm

Modified knapsack-problem:

There are coins of value 1, 5, 8, and 14 cents and weights 1, 1.5, 2, and 4 grams, respectively. Design an algorithm that finds the smallest total weight of coins required to make n cents. For n = 15, the answer would be 4.5 = 1.5 + 1.5 + 1.5 because 15 = 5 + 5 + 5. Your algorithm should run in time O(n).

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!