This is the implementation of the Knapsack-01 problem using Dynamic Programming ,
- Enter the capacity of the knapsack
- Enter the Number of Element
- Enter the Value and the Weight of each element , name is optional
- Calculate the Maximum value of elements which can fit into the Knapsack of that capacity
Check the Main Branch for the code and tests