Largest Sum Contiguous Subarray

it is the efficient program to find the sum of contiguous subarray within a one-dimensional array of numbers which has the largest sum in c++

Author: nitin21897

subarray sum.cpp

@@ -0,0 +1,25 @@
+#include<iostream> 
+using namespace std; 
+
+int maxSubArraySum(int a[], int size) 
+{ 
+int max_so_far = a[0]; 
+int curr_max = a[0]; 
+
+for (int i = 1; i < size; i++) 
+{ 
+		curr_max = max(a[i], curr_max+a[i]); 
+		max_so_far = max(max_so_far, curr_max); 
+} 
+return max_so_far; 
+} 
+
+
+int main() 
+{ 
+int a[] = {-2, -3, 4, -1, -2, 6, 7, -3}; 
+int n = sizeof(a)/sizeof(a[0]); 
+int max_sum = maxSubArraySum(a, n); 
+cout << "Maximum contiguous sum is " << max_sum; 
+return 0; 
+}