1.

What is the time complexity of the above dynamic programming implementation of the Knapsack problem with n items and a maximum weight of W?

A. O(n)
B. O(n + w)
C. O(nW)
D. O(n<sup>2</sup>)
Answer» D. O(n<sup>2</sup>)


Discussion

No Comment Found