Prove that the knapsack problem is in NP

To show a problem belongs to NP, you must do four things:

1) describe the encoding used for the instance

2) describe the encoding used for the certificate

3) describe the algorithm that will check if the certificate is a valid solution

4) analyze the time complexity of that algorithm.

If the complexity is bounded by some polynomial of the input size, then the problem is indeed in NP