Let n=4 Profit={1, 2, 5, 6} Weight= {2, 3, 4, 5} M=8 Find solution to 0/1 Knapsack Problem using Dynamic Programming.

16kviews

written 3.6 years ago by

yashshirsath2127 • 20

modified 22 months ago by

binitamayekar ★ 6.7k

Let n=4 Profit={1, 2, 5, 6} Weight= {2, 3, 4, 5} M=8 Find a solution to 0/1 Knapsack Problem using Dynamic Programming.

analysis of algorithms

ADD COMMENT EDIT

1 Answer

1.0kviews

written 3.6 years ago by

binitamayekar ★ 6.7k

• modified 3.6 years ago

0/1 Knapsack Problem using Dynamic Programming

The given data -

n = 4

Profit = {1, 2, 5, 6} = {p1, p2, p3, p4}

Weight = {2, 3, 4, 5} = {w1, w2, w3, w4}

M = 8

Step 1 -

and 2 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.