Create Kadane'sAlgorithm.cpp

C++/Kadane'sAlgorithm.cpp

@@ -0,0 +1,20 @@
+#include <iostream>
+#include <vector>
+using namespace std;
+
+int kadane(const vector<int>& arr) {
+    int max_so_far = arr[0], max_ending_here = arr[0];
+
+    for (size_t i = 1; i < arr.size(); i++) {
+        max_ending_here = max(arr[i], max_ending_here + arr[i]);
+        max_so_far = max(max_so_far, max_ending_here);
+    }
+
+    return max_so_far;
+}
+
+int main() {
+    vector<int> arr = {-2, 1, -3, 4, -1, 2, 1, -5, 4};
+    cout << "Maximum sum of contiguous subarray is: " << kadane(arr) << endl;
+    return 0;
+}