Dynamic Programming

Question Description

I do not understand these two lines in the knapsack problem. Can someone break it down for me: m[i,w] = m[i-1, w]; if w sub i > w //line 1 m[i,w] = max(m[i-1,w], m[i-1, w - w sub i] + v sub i) if w sub i<= w //line 2 Does line one mean that the benefit of the first i items is the benefit of the first i-1 items? And what does line 2 mean?

This question has not been answered.

Create a free account to get help with this and any other question!

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors