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
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
Beginning Microsoft SQL Server 2012 Programming
Authors: Paul Atkinson, Robert Vieira
1st Edition
1118102282, 9781118102282
