Merge pull request #34 from shubhammarathe15/patch-1

Create 0-1_Knapsack.cpp

Author: AnujitSingh

0-1_Knapsack.cpp

@@ -0,0 +1,28 @@
+#include <bits/stdc++.h>
+using namespace std;
+int knapSack(int W, int wt[], int val[], int n)
+{
+	// making and initializing dp array
+	int dp[W + 1];
+	memset(dp, 0, sizeof(dp));
+
+	for (int i = 1; i < n + 1; i++) {
+		for (int w = W; w >= 0; w--) {
+
+			if (wt[i - 1] <= w)
+				// finding the maximum value
+				dp[w] = max(dp[w],
+							dp[w - wt[i - 1]] + val[i - 1]);
+		}
+	}
+	return dp[W]; // returning the maximum value of knapsack
+}
+int main()
+{
+	int val[] = { 60, 100, 120 };
+	int wt[] = { 10, 20, 30 };
+	int W = 50;
+	int n = sizeof(val) / sizeof(val[0]);
+	cout << knapSack(W, wt, val, n);
+	return 0;
+}