Dynamic Programming-

0/1 Knapsack problem

Dr. Kumkum Saxena

 Knapsack problem
Given some items, pack the knapsack to get
the maximum total value. Each item has some
weight and some value. Total weight that we can
carry is no more than some fixed number W.
So we must consider weights of items as well as
their values.

Item # Weight Value

1 1 8
2 3 6
3 5 5
Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 2
 Knapsack problem
There are two versions of the problem:
1. “0-1 knapsack problem”
◼ Items are indivisible; you either take an item or not.
Some special instances can be solved with dynamic
programming

2. “Fractional knapsack problem”

◼ Items are divisible: you can take any fraction of an
item

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 3

 0-1 Knapsack problem
◼ Given a knapsack with maximum capacity W,
and a set S consisting of n items
◼ Each item i has some weight wi and benefit
value bi (all wi and W are integer values)
◼ Problem: How to pack the knapsack to
achieve maximum total value of packed
items?

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 4

 0-1 Knapsack problem
◼ Problem, in other words, is to find
max  bi subject to  wi  W
iT iT

The problem is called a “0-1” problem,

because each item must be entirely
accepted or rejected.

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 5

 0-1 Knapsack problem: brute-force
approach
Let’s first solve this problem with a
straightforward algorithm
◼ Since there are n items, there are 2n possible
combinations of items.
◼ We go through all combinations and find the
one with maximum value and with total
weight less or equal to W
◼ Running time will be O(2n)

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 6

 0-1 Knapsack problem:
dynamic programming approach
◼ We can do better with an algorithm based on
dynamic programming

◼ We need to carefully identify the subproblems

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 7

 Defining a Subproblem
◼ Given a knapsack with maximum capacity W,
and a set S consisting of n items
◼ Each item i has some weight wi and benefit
value bi (all wi and W are integer values)
◼ Problem: How to pack the knapsack to
achieve maximum total value of packed
items?

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 8

 Defining a Subproblem
◼ We can do better with an algorithm based on
dynamic programming

◼ We need to carefully identify the subproblems

Let’s try this:

If items are labeled 1..n, then a subproblem
would be to find an optimal solution for
Sk = {items labeled 1, 2, .. k}

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 9

 Defining a Subproblem

If items are labeled 1..n, then a subproblem

would be to find an optimal solution for Sk =
{items labeled 1, 2, .. k}

◼ This is a reasonable subproblem definition.

◼ The question is: can we describe the final
solution (Sn ) in terms of subproblems (Sk)?
◼ Unfortunately, we can’t do that.

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 10

 Defining a Subproblem
w1 =2 w2 =4 w3 =5 w4 =3 Weight Benefit
b1 =3 b2 =5 b3 =8 b4 =4 Item wi bi
#
? 1 2 3
Max weight: W = 20 S4 2 4 5
For S4:
Total weight: 14 S5 3 5 8
Maximum benefit: 20
4 3 4
5 9 10
w1 =2 w2 =4 w3 =5 w5 =9
b1 =3 b2 =5 b3 =8 b5 =10
Solution for S4 is
For S5:
Total weight: 20
not part of the
Maximum benefit: 26 solution for S5!!!
Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 11
 Defining a Subproblem
◼ As we have seen, the solution for S4 is not part
of the solution for S5

◼ So our definition of a subproblem is flawed and

we need another one!

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 12

 Defining a Subproblem
◼ Given a knapsack with maximum capacity W,
and a set S consisting of n items
◼ Each item i has some weight wi and benefit
value bi (all wi and W are integer values)
◼ Problem: How to pack the knapsack to
achieve maximum total value of packed
items?

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 13

 Defining a Subproblem
◼ Let’s add another parameter: w, which will
represent the maximum weight for each subset
of items

◼ The subproblem then will be to compute V[k,w],

i.e., to find an optimal solution for Sk = {items
labeled 1, 2, .. k} in a knapsack of size w

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 14

 Recursive Formula for
subproblems
◼ The subproblem will then be to compute V[k,w],
i.e., to find an optimal solution for Sk = {items
labeled 1, 2, .. k} in a knapsack of size w

◼ Assuming knowing V[i, j], where i=0,1, 2, … k-1,

j=0,1,2, …w, how to derive V[k,w]?

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 15

 Recursive Formula for
subproblems (continued)
Recursive formula for subproblems:
 V [k − 1, w] if wk  w
V [ k , w] = 
max{V [k − 1, w],V [k − 1, w − wk ] + bk } else

It means, that the best subset of Sk that has

total weight w is:
1) the best subset of Sk-1 that has total weight  w,
or
2) the best subset of Sk-1 that has total weight  w-
wk plus the item k
Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 16
 Recursive Formula
 V [k − 1, w] if wk  w
V [ k , w] = 
max{V [k − 1, w],V [k − 1, w − wk ] + bk } else

◼ The best subset of Sk that has the total weight 

w, either contains item k or not.
◼ First case: wk>w. Item k can’t be part of the
solution, since if it was, the total weight would be
> w, which is unacceptable.
◼ Second case: wk  w. Then the item k can be in
the solution, and we choose the case with
greater value.

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 17

 0-1 Knapsack Algorithm
for w = 0 to W
V[0,w] = 0
for i = 1 to n
V[i,0] = 0
for i = 1 to n
for w = 0 to W
if wi <= w // item i can be part of the solution
if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 18
 Running time
for w = 0 to W
O(W)
V[0,w] = 0
for i = 1 to n
V[i,0] = 0
for i = 1 to n Repeat n times
for w = 0 to W O(W)
< the rest of the code >
What is the running time of this algorithm?
O(n*W)
Remember that the brute-force algorithm takes O(2n)
Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 19
 Example

Let’s run our algorithm on the

following data:

n = 4 (# of elements)
W = 5 (max weight)
Elements (weight, benefit):
(2,3), (3,4), (4,5), (5,6)

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 20

 Example (2)
i\W 0 1 2 3 4 5
0 0 0 0 0 0 0
1
2
3
4

for w = 0 to W
V[0,w] = 0

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 21

 Example (3)
i\W 0 1 2 3 4 5
0 0 0 0 0 0 0
1 0
2 0
3 0
4 0

for i = 1 to n
V[i,0] = 0

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 22

 Items:
Example (4) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=1 4: (5,6)
0 0 0 0 0 0 0 bi=3
1 0 0
wi=2
2 0
w=1
3 0
w-wi =-1
4 0
if wi <= w // item i can be part of the solution
if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 23
 Items:
Example (5) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=1 4: (5,6)
0 0 0 0 0 0 0 bi=3
1 0 0 3
wi=2
2 0
w=2
3 0
w-wi =0
4 0
if wi <= w // item i can be part of the solution
if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 24
 Items:
Example (6) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=1 4: (5,6)
0 0 0 0 0 0 0 bi=3
1 0 0 3 3
wi=2
2 0
w=3
3 0
w-wi =1
4 0
if wi <= w // item i can be part of the solution
if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 25
 Items:
Example (7) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=1 4: (5,6)
0 0 0 0 0 0 0 bi=3
1 0 0 3 3 3
wi=2
2 0
w=4
3 0
w-wi =2
4 0
if wi <= w // item i can be part of the solution
if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 26
 Items:
Example (8) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=1 4: (5,6)
0 0 0 0 0 0 0 bi=3
1 0 0 3 3 3 3
wi=2
2 0
w=5
3 0
w-wi =3
4 0
if wi <= w // item i can be part of the solution
if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 27
 Items:
Example (9) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=2 4: (5,6)
0 0 0 0 0 0 0 bi=4
1 0 0 3 3 3 3
wi=3
2 0 0
w=1
3 0
w-wi =-2
4 0
if wi <= w // item i can be part of the solution
if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 28
 Items:
Example (10) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=2 4: (5,6)
0 0 0 0 0 0 0 bi=4
1 0 0 3 3 3 3
wi=3
2 0 0 3
w=2
3 0
w-wi =-1
4 0
if wi <= w // item i can be part of the solution
if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 29
 Items:
Example (11) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=2 4: (5,6)
0 0 0 0 0 0 0 bi=4
1 0 0 3 3 3 3
wi=3
2 0 0 3 4
w=3
3 0
w-wi =0
4 0
if wi <= w // item i can be part of the solution
if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 30
 Items:
Example (12) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=2 4: (5,6)
0 0 0 0 0 0 0 bi=4
1 0 0 3 3 3 3
wi=3
2 0 0 3 4 4
w=4
3 0
w-wi =1
4 0
if wi <= w // item i can be part of the solution
if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 31
 Items:
Example (13) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=2 4: (5,6)
0 0 0 0 0 0 0 bi=4
1 0 0 3 3 3 3
wi=3
2 0 0 3 4 4 7
w=5
3 0
w-wi =2
4 0
if wi <= w // item i can be part of the solution
if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 32
 Items:
Example (14) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=3 4: (5,6)
0 0 0 0 0 0 0 bi=5
1 0 0 3 3 3 3
wi=4
2 0 0 3 4 4 7
w= 1..3
3 0 0 3 4
4 0
if wi <= w // item i can be part of the solution
if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 33
 Items:
Example (15) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=3 4: (5,6)
0 0 0 0 0 0 0 bi=5
1 0 0 3 3 3 3
wi=4
2 0 0 3 4 4 7
w= 4
3 0 0 3 4 5
w- wi=0
4 0
if wi <= w // item i can be part of the solution
if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 34
 Items:
Example (16) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=3 4: (5,6)
0 0 0 0 0 0 0 bi=5
1 0 0 3 3 3 3
wi=4
2 0 0 3 4 4 7
w= 5
3 0 0 3 4 5 7
w- wi=1
4 0
if wi <= w // item i can be part of the solution
if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 35
 Items:
Example (17) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=4 4: (5,6)
0 0 0 0 0 0 0 bi=6
1 0 0 3 3 3 3
wi=5
2 0 0 3 4 4 7
w= 1..4
3 0 0 3 4 5 7
4 0 0 3 4 5
if wi <= w // item i can be part of the solution
if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 36
 Items:
Example (18) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=4 4: (5,6)
0 0 0 0 0 0 0 bi=6
1 0 0 3 3 3 3
wi=5
2 0 0 3 4 4 7
w= 5
3 0 0 3 4 5 7
w- wi=0
4 0 0 3 4 5 7
if wi <= w // item i can be part of the solution
if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 37
 Comments
◼ This algorithm only finds the max possible
value that can be carried in the knapsack
◼ i.e., the value in V[n,W]
◼ To know the items that make this maximum
value, an addition to this algorithm is
necessary

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 38

 How to find actual Knapsack Items

◼ All of the information we need is in the table.

◼ V[n,W] is the maximal value of items that can be
placed in the Knapsack.
◼ Let i=n and k=W
if V[i,k]  V[i−1,k] then
mark the ith item as in the knapsack
i = i−1, k = k-wi
else
i = i−1 // Assume the ith item is not in the knapsack
// Could it be in the optimally packed
knapsack?

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 39

 Items:
Finding the Items 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=4 4: (5,6)
0 0 0 0 0 0 0 k= 5
1 0 0 3 3 3 3 bi=6
2 0 0 3 4 4 7 wi=5
3 0 0 3 4 5 7 V[i,k] = 7
V[i−1,k] =7
4 0 0 3 4 5 7
i=n, k=W
while i,k > 0
if V[i,k]  V[i−1,k] then
mark the ith item as in the knapsack
i = i−1, k = k-wi
else
Dr. Kumkum Saxena i−1 Programming-0/1 Knapsack Problem
i =Dynamic page 40
 Items:
Finding the Items (2) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=4 4: (5,6)
0 0 0 0 0 0 0 k= 5
1 0 0 3 3 3 3 bi=6
2 0 0 3 4 4 7 wi=5
3 0 0 3 4 5 7 V[i,k] = 7
V[i−1,k] =7
4 0 0 3 4 5 7
i=n, k=W
while i,k > 0
if V[i,k]  V[i−1,k] then
mark the ith item as in the knapsack
i = i−1, k = k-wi
else
Dr. Kumkum Saxena i−1 Programming-0/1 Knapsack Problem
i =Dynamic page 41
 Items:
Finding the Items (3) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=3 4: (5,6)
0 0 0 0 0 0 0 k= 5
1 0 0 3 3 3 3 bi=5
2 0 0 3 4 4 7 wi=4
3 0 0 3 4 5 7 V[i,k] = 7
V[i−1,k] =7
4 0 0 3 4 5 7
i=n, k=W
while i,k > 0
if V[i,k]  V[i−1,k] then
mark the ith item as in the knapsack
i = i−1, k = k-wi
else
Dr. Kumkum Saxena i−1 Programming-0/1 Knapsack Problem
i =Dynamic page 42
 Items:
Finding the Items (4) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=2 4: (5,6)
0 0 0 0 0 0 0 k= 5
1 0 0 3 3 3 3 bi=4
2 0 0 3 4 4 7 wi=3
3 0 0 3 4 5 7 V[i,k] = 7
V[i−1,k] =3
4 0 0 3 4 5 7
k − wi=2
i=n, k=W
while i,k > 0
if V[i,k]  V[i−1,k] then
mark the ith item as in the knapsack
i = i−1, k = k-wi
else
Dr. Kumkum Saxena i−1 Programming-0/1 Knapsack Problem
i =Dynamic page 43
 Items:
Finding the Items (5) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=1 4: (5,6)
0 0 0 0 0 0 0 k= 2
1 0 0 3 3 3 3 bi=3
2 0 0 3 4 4 7 wi=2
3 0 0 3 4 5 7 V[i,k] = 3
V[i−1,k] =0
4 0 0 3 4 5 7
k − wi=0
i=n, k=W
while i,k > 0
if V[i,k]  V[i−1,k] then
mark the ith item as in the knapsack
i = i−1, k = k-wi
else
Dr. Kumkum Saxena i−1 Programming-0/1 Knapsack Problem
i =Dynamic page 44
 Items:
Finding the Items (6) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 i=0 4: (5,6)
0 0 0 0 0 0 0 k= 0
1 0 0 3 3 3 3
2 0 0 3 4 4 7
3 0 0 3 4 5 7 The optimal
knapsack
4 0 0 3 4 5 7
should contain
i=n, k=W {1, 2}
while i,k > 0
if V[i,k]  V[i−1,k] then
mark the nth item as in the knapsack
i = i−1, k = k-wi
else
Dr. Kumkum Saxena i−1 Programming-0/1 Knapsack Problem
i =Dynamic page 45
 Items:
Finding the Items (7) 1: (2,3)
2: (3,4)
3: (4,5)
i\W 0 1 2 3 4 5 4: (5,6)
0 0 0 0 0 0 0
1 0 0 3 3 3 3
2 0 0 3 4 4 7
3 0 0 3 4 5 7 The optimal
knapsack
4 0 0 3 4 5 7
should contain
i=n, k=W {1, 2}
while i,k > 0
if V[i,k]  V[i−1,k] then
mark the nth item as in the knapsack
i = i−1, k = k-wi
else
Dr. Kumkum Saxena i−1 Programming-0/1 Knapsack Problem
i =Dynamic page 46
 Memorization (Memory Function Method)

◼ Goal:
Solve only subproblems that are necessary and solve it only once
◼
◼ Memorization is another way to deal with overlapping subproblems in
dynamic programming
◼ With memorization, we implement the algorithm recursively:
◼ If we encounter a new subproblem, we compute and store the
solution.
◼ If we encounter a subproblem we have seen, we look up the answer
◼ Most useful when the algorithm is easiest to implement recursively
◼ Especially if we do not need solutions to all subproblems.

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 47

 0-1 Knapsack Memory Function
Algorithm
for i = 1 to n MFKnapsack(i, w)
for w = 1 to W if V[i,w] < 0
V[i,w] = -1 if w < wi
value = MFKnapsack(i-1, w)
for w = 0 to W else
V[0,w] = 0 value = max(MFKnapsack(i-1, w),
for i = 1 to n bi + MFKnapsack(i-1, w-wi))
V[i,0] = 0 V[i,w] = value
return V[i,w]

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 48

 Conclusion

◼ Dynamic programming is a useful technique

of solving certain kind of problems
◼ When the solution can be recursively
described in terms of partial solutions, we can
store these partial solutions and re-use them
as necessary (memorization)
◼ Running time of dynamic programming
algorithm vs. naïve algorithm:
◼ 0-1 Knapsack problem: O(W*n) vs. O(2n)

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 49

 The maximum weight the
knapsack can hold is W is 11

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 50

Dr. Kumkum Saxena Dynamic Programming-0/1 Knapsack Problem page 51