diff --git a/DSA/Arrays/Kaden's Algorithm.cpp b/DSA/Arrays/Kaden's Algorithm.cpp
new file mode 100644
index 0000000..ab9baf2
--- /dev/null
+++ b/DSA/Arrays/Kaden's Algorithm.cpp	
@@ -0,0 +1,34 @@
+// C++ program to print largest contiguous array sum
+#include<iostream>
+#include<climits>
+using namespace std;
+
+int maxSubArraySum(int a[], int size)
+{
+	int max_so_far = INT_MIN, max_ending_here = 0;
+
+	for (int i = 0; i < size; 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;
+	}
+	return max_so_far;
+}
+
+/*Driver program to test maxSubArraySum*/
+int main()
+{
+	int n;
+    cout<<"Enter the number of elements: ";
+    cin>>n;
+    int arr[n];
+    cout<<"Enter elements: ";
+    for(int i=0; i<n; i++) cin>>arr[i];
+	int max_sum = maxSubArraySum(arr, n);
+	cout << "Maximum contiguous sum is " << max_sum;
+	return 0;
+}