Added an Algorithm for max-continous sub-array

Kadane/kadane.py

@@ -0,0 +1,18 @@
+import sys
+def maxSubArraySum(a, size):
+    max_so_far = -sys.maxsize - 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 = [-1, 0, 4, 2, -7, 1, 2, -3]
+print("Maximum contiguous sum is", maxSubArraySum(a, len(a)))

README.md

@@ -32,6 +32,8 @@ After you've added code, just come back to readme and add your name under contri
 
 [Milind Kumar](https://github.com/Graviton5)
 
+[Ayan Banerjee](https://github.com/Ayan1089)
+
 [Your name here](Your GitHub/Linkedin URL here)
 
 ## Final words