From 333178df066854a8ab401b385cbeee331d80b84b Mon Sep 17 00:00:00 2001
From: Samiksha Upadhyay <yjsamiksha@gmail.com>
Date: Fri, 1 Oct 2021 17:33:42 +0530
Subject: [PATCH] Added program solving 0-1 knapsack problem

---
 C++/0-1 Knapsack.cpp | 45 ++++++++++++++++++++++++++++++++++++++++++++
 C++/BinarySearch     | 27 --------------------------
 2 files changed, 45 insertions(+), 27 deletions(-)
 create mode 100644 C++/0-1 Knapsack.cpp
 delete mode 100644 C++/BinarySearch

diff --git a/C++/0-1 Knapsack.cpp b/C++/0-1 Knapsack.cpp
new file mode 100644
index 00000000..f776c207
--- /dev/null
+++ b/C++/0-1 Knapsack.cpp	
@@ -0,0 +1,45 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+vector<vector<int> > dp(100, vector<int>(100, -1));
+
+int find(vector<int>& v, vector<int>& w, int W, int i, int sum)
+{
+	if(W < 0)
+		return 0;
+	
+	if(i == v.size() || W == 0)
+	{
+		return sum;
+	}
+	
+	if(dp[W][i] != -1)
+	{
+		return dp[W][i];
+	}
+	
+	dp[W][i] = max(find(v, w, W, i + 1, sum), find(v, w, W - w[i], i + 1, sum + v[i]));
+	return dp[W][i];
+}
+
+int main()
+{
+	int n;
+	cin >> n;
+	
+	vector<int> v(n, 0);
+	vector<int> w(n, 0);
+	
+	for(int i = 0; i < n; i++)
+		cin >> v[i];
+		
+	for(int i = 0; i < n; i++)
+		cin >> w[i];
+		
+	int W;
+	cin >> W;
+	
+	cout << find(v, w, W, 0, 0);
+		
+}
diff --git a/C++/BinarySearch b/C++/BinarySearch
deleted file mode 100644
index 8ef66d78..00000000
--- a/C++/BinarySearch
+++ /dev/null
@@ -1,27 +0,0 @@
-#include <iostream>
-using namespace std;
-int binarysearch(int a[],int n,int num){
-    int beg=0;
-    int end=n-1;
-    int mid;
-    while(beg<=end){
-        mid=(beg+end)/2;
-        if(a[mid]==num)
-            return mid;
-        else if(a[mid]<num)
-            beg=mid+1;
-        else
-            end=mid-1;
-    }
-    return -1;
-}
-int main()
-{
-    int a[10]={11,22,33,44,55,66,77,88,99,100};
-    int x=binarysearch(&a[0],10,100);
-    if(x>0)
-        cout<<"The num found at index "<<x<<endl;
-    else 
-    cout<<"Bye Bye Khatam Tata\n";
-    return 0;
-}