From d16ae9350b95aa015017140fc6c0623711543779 Mon Sep 17 00:00:00 2001
From: Aditya Jain <34396222+adityajain1677@users.noreply.github.com>
Date: Wed, 4 Dec 2019 13:17:48 +0530
Subject: [PATCH] Adding Kadane Algorithm (#606)

* Adding Kadane Algorithm

* std::cin and std::cout

* Rename Dynamic Programming/kadane algorithm.cpp to dynamic_programming/kadane.cpp

* Update kadane.cpp

* Update kadane.cpp

* // NOLINT
---
 dynamic_programming/kadane.cpp | 30 ++++++++++++++++++++++++++++++
 1 file changed, 30 insertions(+)
 create mode 100644 dynamic_programming/kadane.cpp

diff --git a/dynamic_programming/kadane.cpp b/dynamic_programming/kadane.cpp
new file mode 100644
index 000000000..bf2aa76ac
--- /dev/null
+++ b/dynamic_programming/kadane.cpp
@@ -0,0 +1,30 @@
+#include<iostream>
+#include<climits>
+
+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;
+}
+
+
+int main() {
+    int n, i;
+    std::cout << "Enter the number of elements \n";
+    std::cin >> n;
+    int a[n];  // NOLINT
+    for (i = 0; i < n; i++) {
+        std::cin >> a[i];
+    }
+    int max_sum = maxSubArraySum(a, n);
+    std::cout << "Maximum contiguous sum is " << max_sum;
+    return 0;
+}