diff --git a/Kadanes_Algorithm.py b/Kadanes_Algorithm.py
new file mode 100644
index 0000000..06b8f9e
--- /dev/null
+++ b/Kadanes_Algorithm.py
@@ -0,0 +1,18 @@
+def maxSubArraySum(arr,size):
+    
+    max_till_now = arr[0]
+    max_ending = 0
+    
+    for i in range(0, size):
+        max_ending = max_ending + arr[i]
+        if max_ending < 0:
+            max_ending = 0
+        
+        
+        elif (max_till_now < max_ending):
+            max_till_now = max_ending
+            
+    return max_till_now
+
+arr = [-2, -3, 4, -1, -2, 5, -3]
+print("Maximum Sub Array Sum Is" , maxSubArraySum(arr,len(arr)))