diff --git a/CPP DSA/Kadanes_Algorithm.cpp b/CPP DSA/Kadanes_Algorithm.cpp
new file mode 100644
index 00000000..2a70671c
--- /dev/null
+++ b/CPP DSA/Kadanes_Algorithm.cpp	
@@ -0,0 +1,23 @@
+
+
+#include <iostream>
+using namespace std;
+int main()
+{
+    int a[] = { -2, -3, 4, -1, -2, 1, 5, -3 };
+    int n = sizeof(a) / sizeof(a[0]);
+
+    //  Kadane's algorithm  
+    int max_so_far = INT_MIN, max_ending_here = 0;
+
+    for (int i = 0; i < n; i++) {
+        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;
+    }
+    cout << "Maximum contiguous sum in the array is : " << max_so_far << endl;
+    return 0;
+}
\ No newline at end of file