added knapsack

Author: kothariji

Dynamic Programming/(GEEKSFORGEEKS)0-1 Knapsack Problem.cpp

@@ -0,0 +1,40 @@
+#include<bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+#define MAX 1005
+using namespace std;
+
+int dp[1002][1002];
+
+int knapsack(int weight[], int value[], int w, int index)
+{
+    if((index < 0) || (w == 0))
+        return 0;
+    
+    if(dp[index][w] != -1)
+    	return dp[index][w];
+   
+    if(weight[index] <= w)
+        return dp[index][w] = max((value[index] + knapsack(weight, value, w - weight[index], index-1)),knapsack(weight, value, w, index-1));
+    else 
+        return dp[index][w] = knapsack(weight, value, w, index-1);
+}
+
+int main()
+ {
+	int t;
+	cin>>t;
+	while(t--)
+	{   
+	    memset(dp, -1, sizeof(dp));
+	    int n, w;
+	    cin>>n>>w;
+	    int weight[n], value[n];
+	    for(int i =0; i<n; i++)
+	        cin>>value[i];
+	    for(int i =0; i<n; i++)
+	        cin>>weight[i];
+	    cout<<knapsack(weight, value, w, n-1)<<endl;
+	}
+	return 0;
+}

Dynamic Programming/0-1 Knapsack Memoisation.cpp

@@ -0,0 +1,46 @@
+#include<bits/stdc++.h>
+#define MAX 1005
+using namespace std;
+
+vector < vector<int> > dp(MAX, vector<int> (MAX, -1));
+
+int knapsack(vector <int> weight, vector <int> value, int maxweight, int index)
+{
+	//base condition
+	if( (index < 0) || (maxweight <= 0) )
+		return 0;
+	if(dp[index][maxweight] == -1)
+	{
+		if(weight[index] <= maxweight)
+			dp[index][maxweight] =  max(value[index] + knapsack(weight, value, maxweight - weight[index], index-1), knapsack(weight, value, maxweight, index-1));
+		
+		else
+			dp[index][maxweight] = knapsack(weight, value, maxweight, index-1);
+	}
+	return dp[index][maxweight];
+}
+
+
+
+int main()
+{
+	int n;
+	cout<<"Enter the number of items: ";
+	cin>>n;
+	vector <int> weight(n), value(n);
+
+	cout<<"enter weights: "<<endl;
+	for(int  i=0; i<n; i++)
+		cin>>weight[i];
+	cout<<"enter values: "<<endl;
+	for(int  i=0; i<n; i++)
+		cin>>value[i];
+
+	
+	int maxweight;
+
+	cout<<"Enter maximum capacity of knapsack: ";
+	cin>>maxweight;
+
+	cout<<knapsack(weight, value, maxweight, n-1);
+}

BinarySearchTree/(CODECHEF) Binary_Operations.py renamed to Tree/(CODECHEF) Binary_Operations.py

@@ -1,60 +1,60 @@
-import sys
-sys.setrecursionlimit(10**6)
-
-class Node:
-    def __init__(self, val, pos):
-        self.left = None
-        self.right = None
-        self.pos = pos
-        self.val = val
-
-def insert(node, val, pos):
-    if node is None:
-        print(pos)
-        return Node(val, pos)
-    if val < node.val: # move to left child
-        node.left = insert(node.left, val, 2*pos)
-    else: # move to right child
-        node.right = insert(node.right, val, 2*pos+1)
-    return node
-
-def minValueNode(node):
-    current = node
-    while current.left is not None:
-        current = current.left
-    return current
-
-def delete(node,val, case=True):
-    if node is None:
-        return node
-    # search 
-    if val < node.val: # move to left child
-        node.left = delete(node.left, val, case)
-    elif val > node.val: # move to right child
-        node.right = delete(node.right, val, case)
-    else: # here found 
-        if case:
-            print(node.pos)
-        # Now delete node and replacement
-        if node.left is None and node.right is None: # check left child, if None 
-            node = None
-        elif node.left is None:
-            node = node.right
-        elif node.right is None:
-            node = node.left
-        else:
-            temp = minValueNode(node.right)
-            node.val = temp.val
-            node.right = delete(node.right, temp.val, False)
-    return node
-root = None
-def main(q):
-    global root
-    oper, elem = input().split()
-    if oper == 'i':
-        root = insert(root, int(elem), 1)
-    else:
-        root = delete(root, int(elem), True)
-    if q>1:
-        main(q-1)
+import sys
+sys.setrecursionlimit(10**6)
+
+class Node:
+    def __init__(self, val, pos):
+        self.left = None
+        self.right = None
+        self.pos = pos
+        self.val = val
+
+def insert(node, val, pos):
+    if node is None:
+        print(pos)
+        return Node(val, pos)
+    if val < node.val: # move to left child
+        node.left = insert(node.left, val, 2*pos)
+    else: # move to right child
+        node.right = insert(node.right, val, 2*pos+1)
+    return node
+
+def minValueNode(node):
+    current = node
+    while current.left is not None:
+        current = current.left
+    return current
+
+def delete(node,val, case=True):
+    if node is None:
+        return node
+    # search 
+    if val < node.val: # move to left child
+        node.left = delete(node.left, val, case)
+    elif val > node.val: # move to right child
+        node.right = delete(node.right, val, case)
+    else: # here found 
+        if case:
+            print(node.pos)
+        # Now delete node and replacement
+        if node.left is None and node.right is None: # check left child, if None 
+            node = None
+        elif node.left is None:
+            node = node.right
+        elif node.right is None:
+            node = node.left
+        else:
+            temp = minValueNode(node.right)
+            node.val = temp.val
+            node.right = delete(node.right, temp.val, False)
+    return node
+root = None
+def main(q):
+    global root
+    oper, elem = input().split()
+    if oper == 'i':
+        root = insert(root, int(elem), 1)
+    else:
+        root = delete(root, int(elem), True)
+    if q>1:
+        main(q-1)
 main(int(input()))

BinarySearchTree/(LEETCODE) BinaryTreeZigzagLevelOrderTraversal.cpp renamed to Tree/(LEETCODE) BinaryTreeZigzagLevelOrderTraversal.cpp

@@ -1,27 +1,27 @@
-struct FenwickTreeMin {
-    vector<int> bit;
-    int n;
-    const int INF = (int)1e9;
-
-    FenwickTreeMin(int n) {
-        this->n = n;
-        bit.assign(n, INF);
-    }
-
-    FenwickTreeMin(vector<int> a) : FenwickTreeMin(a.size()) {
-        for (size_t i = 0; i < a.size(); i++)
-            update(i, a[i]);
-    }
-
-    int getmin(int r) {
-        int ret = INF;
-        for (; r >= 0; r = (r & (r + 1)) - 1)
-            ret = min(ret, bit[r]);
-        return ret;
-    }
-
-    void update(int idx, int val) {
-        for (; idx < n; idx = idx | (idx + 1))
-            bit[idx] = min(bit[idx], val);
-    }
-};
+struct FenwickTreeMin {
+    vector<int> bit;
+    int n;
+    const int INF = (int)1e9;
+
+    FenwickTreeMin(int n) {
+        this->n = n;
+        bit.assign(n, INF);
+    }
+
+    FenwickTreeMin(vector<int> a) : FenwickTreeMin(a.size()) {
+        for (size_t i = 0; i < a.size(); i++)
+            update(i, a[i]);
+    }
+
+    int getmin(int r) {
+        int ret = INF;
+        for (; r >= 0; r = (r & (r + 1)) - 1)
+            ret = min(ret, bit[r]);
+        return ret;
+    }
+
+    void update(int idx, int val) {
+        for (; idx < n; idx = idx | (idx + 1))
+            bit[idx] = min(bit[idx], val);
+    }
+};