Add kadane's algorithm

python_implemented/kadanes_algorithm.py

@@ -0,0 +1,30 @@
+from sys import maxsize
+
+def maxSubArraySum(a, size):
+    max_so_far = -maxsize - 1
+    max_ending_here = 0
+    start = 0
+    end = 0
+    s = 0
+
+    for i in range(0, size):
+
+        max_ending_here += a[i]
+
+        if max_so_far < max_ending_here:
+            max_so_far = max_ending_here
+            start = s
+            end = i
+
+        if max_ending_here < 0:
+            max_ending_here = 0
+            s = i + 1
+
+    print ("Maximum contiguous sum is %d" % (max_so_far))
+    print ("Starting Index %d" % (start))
+    print ("Ending Index %d" % (end))
+
+
+# Driver program to test maxSubArraySum
+a = [-2, -3, 4, -1, -2, 1, 5, -3]
+maxSubArraySum(a, len(a))