From a063bb483cfe6c5826b15122f33a3adda2007ba7 Mon Sep 17 00:00:00 2001
From: hash-7 <shekhar1996@gmail.com>
Date: Sat, 7 Oct 2017 02:08:23 +0530
Subject: [PATCH 1/2] Kadane`s algorithm

Used to find the largest contiguous sum in a one-dimensional array
---
 Dynamic Programming/Kadane | 32 ++++++++++++++++++++++++++++++++
 1 file changed, 32 insertions(+)
 create mode 100644 Dynamic Programming/Kadane

diff --git a/Dynamic Programming/Kadane b/Dynamic Programming/Kadane
new file mode 100644
index 000000000000..782f790d2584
--- /dev/null
+++ b/Dynamic Programming/Kadane	
@@ -0,0 +1,32 @@
+package kadane;
+import java.util.*;
+import java.io.*;
+/*Find the sum of contiguous subarray within a one-dimensional array
+of numbers which has the largest sum.*/
+/*In this case the maximum sum will come from segment 
+[4,3,-1,5]*/
+public class kadane {
+	public static void main(String args[])
+	{
+		int [] testArray={-2,4,3,-1,5,-6,-2};
+		System.out.println("Maximum continuous sum is "+ kadane(testArray));
+	}
+	static int kadane(int array[])
+	{
+		int size=array.length;
+		int maxSoFar=array[0];
+		int curMax=array[0];
+		for(int i=1;i<size;i++)
+		{			
+			if(curMax+array[i]>array[i])
+				curMax=curMax+array[i];
+			else
+				curMax=array[i];
+			if(maxSoFar<curMax)
+				maxSoFar=curMax;			
+		}
+		return maxSoFar;
+	}
+	
+
+}

From 9383529b0903d8bc06bbad51055812935a3bffb9 Mon Sep 17 00:00:00 2001
From: hash-7 <shekhar1996@gmail.com>
Date: Sat, 7 Oct 2017 02:09:21 +0530
Subject: [PATCH 2/2] Rename Kadane to Kadane.java

---
 Dynamic Programming/{Kadane => Kadane.java} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Dynamic Programming/{Kadane => Kadane.java} (100%)

diff --git a/Dynamic Programming/Kadane b/Dynamic Programming/Kadane.java
similarity index 100%
rename from Dynamic Programming/Kadane
rename to Dynamic Programming/Kadane.java