Adding Kadane's algorithm py

delete_this/kadanes_algorithm.py

@@ -0,0 +1,21 @@
+# Python program to find maximum contiguous subarray using Kadane's Algorithm.
+
+# Function to find the maximum contiguous subarray 
+from sys import maxint 
+def maxSubArraySum(a,size): 
+
+    max_so_far = -maxint - 1
+    max_ending_here = 0
+
+    for i in range(0, size): 
+        max_ending_here = max_ending_here + a[i] 
+        if (max_so_far < max_ending_here): 
+            max_so_far = max_ending_here 
+
+        if max_ending_here < 0: 
+            max_ending_here = 0   
+    return max_so_far 
+
+# Driver function to check the above function  
+a = [-2, -3, 4, -1, -2, 1, 5, -3]
+print "Maximum contiguous sum is", maxSubArraySum(a,len(a))