From 96428b5d571a3b76191a8be4b38cbdcb596cf0a5 Mon Sep 17 00:00:00 2001
From: jasmine-k05 <64699132+jasmine-k05@users.noreply.github.com>
Date: Sat, 17 Oct 2020 16:21:12 +0530
Subject: [PATCH] Java Program 0-1 Knapsack Problem

---
 Java Program 0-1 Knapsack Problem | 39 +++++++++++++++++++++++++++++++
 1 file changed, 39 insertions(+)
 create mode 100644 Java Program 0-1 Knapsack Problem

diff --git a/Java Program 0-1 Knapsack Problem b/Java Program 0-1 Knapsack Problem
new file mode 100644
index 00000000..2c664345
--- /dev/null
+++ b/Java Program 0-1 Knapsack Problem	
@@ -0,0 +1,39 @@
+/* A Naive recursive implementation of 0-1 Knapsack problem */
+class Knapsack { 
+
+	// A utility function that returns maximum of two integers 
+	static int max(int a, int b) { return (a > b) ? a : b; } 
+
+	// Returns the maximum value that can 
+	// be put in a knapsack of capacity W 
+	static int knapSack(int W, int wt[], int val[], int n) 
+	{ 
+		// Base Case 
+		if (n == 0 || W == 0) 
+			return 0; 
+
+		// If weight of the nth item is more 
+		// than Knapsack capacity W, then 
+		// this item cannot be included in the optimal solution 
+		if (wt[n - 1] > W) 
+			return knapSack(W, wt, val, n - 1); 
+
+		// Return the maximum of two cases: 
+		// (1) nth item included 
+		// (2) not included 
+		else
+			return max(val[n - 1] + knapSack(W - wt[n - 1], wt, val, n - 1), 
+					knapSack(W, wt, val, n - 1)); 
+	} 
+
+	// Driver program to test above function 
+	public static void main(String args[]) 
+	{ 
+		int val[] = new int[] { 60, 100, 120 }; 
+		int wt[] = new int[] { 10, 20, 30 }; 
+		int W = 50; 
+		int n = val.length; 
+		System.out.println(knapSack(W, wt, val, n)); 
+	} 
+} 
+/*This code is contributed by Rajat Mishra */