Suppose There Are N Gold Bricks Where The L Th Gold Brick Weights P 0 Pounds And Is Worth D 0 B Dollars Given A 1 (153.58 KiB) Viewed 25 times
Algorithm simulator Plz
Suppose there are n gold bricks, where the l-th gold brick & weights p > 0 pounds and is worth d > 0 B dollars. Given a knapsack with capacity C > 0, your goal is to put as much gold as possible into the knapsack such that the total value we can gain is maximized where you've permitted to break the bricks Assume, n = 4 gold bricks with (p. d) set = {(280, 40).(100, 10).(120, 20).(120, 24)), and capacity C = 60
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!