

MCQOPTIONS
Saved Bookmarks
1. |
WHAT_IS_THE_SPACE_COMPLEXITY_OF_THE_ABOVE_DYNAMIC_PROGRAMMING_IMPLEMENTATION_OF_THE_KNAPSACK_PROBLEM??$ |
A. | O(n) |
B. | O(n + w) |
C. | O(nW) |
D. | O(n<sup>2</sup>) |
Answer» E. | |