**Exercise 16.2-2**

For this algorithm, let c[i,w] = value of solution for items 1..i and maximum weight w.

c[i,w] =

DP-01K(v, w, n, W)

1
for w = 0 to W

2
c[0,w] = 0

3
for i = 1 to n

4
c[i,0] = 0

5
for w = 1 to W

6
if w[i] w

7
then if v[i] + c[i-1,w-w[i]] > c[i-1,w]

8
then c[i,w] = v[i] + c[i-1,w-w[i]]

9
else c[i,w] = c[i-1,w]

10
else c[i,w] = c[i-1,w]

The run time performance of this algorithm is
.