0/1 Knapsack using Tabulation method

Author: raunakpandey1

Dynamic Programming/knapsack_01.cpp

@@ -85,6 +85,28 @@ class Solution
     }
 };
 
+
+// Alternative Method for 0/1 Knapsack 
+//Tabulation Method (Bottom-up Approach)
+//Function to return max value that can be put in knapsack of capacity W.
+    int knapSack(int W, int wt[], int val[], int n) 
+    { 
+       // Your code here
+       int dp[n+1][W+1];
+       for(int i=0;i<n+1;i++)
+       {
+           for(int j=0;j<W+1;j++)
+           if(i==0 || j==0)
+               dp[i][j]=0;
+           else if(wt[i-1]<=j)
+               dp[i][j]= max(val[i-1] + dp[i-1][j-wt[i-1]] , dp[i-1][j]);
+           else
+               dp[i][j]= dp[i-1][j];
+       }
+       return dp[n][W]; 
+    }
+
+
 // { Driver Code Starts.
 
 int main()