title: How to understand the knapsack problem is NP-complete?
body: <p>We know that the knapsack problem can be solved in O(nW) complexity by dynamic programming. But we say this is a NP-complete problem. I feel it is hard to understand here.</p>
  
  <p>(n is the number of items. W is the maximum volume.)</p>