Is The Knapsack Problem NP-complete?

Is The Knapsack Problem NP-complete? The decision problem form of the knapsack problem (Can a value of at least V be achieved without exceeding the weight W?) is NP-complete, thus there is no known algorithm both correct and fast (polynomial-time) in all cases. … There is a pseudo-polynomial time algorithm using dynamic programming. How do