medium10 pts · first answer countsdynamic-programmingknapsackspace-optimization

Direction of the capacity loop

In the 1D 0/1 knapsack, dp[w] = max(dp[w], dp[w - wt] + val). Why must w go from W down to wt?

A.Going up would let an item be reusedB.Going up gives an index out of rangeC.Going down is faster for the CPU cacheD.Going up skips the base case

Discussion 0

Join free to post in the discussion.