Question

C++
max_subarray(Arr): return a contiguous subarray within Arr which has the largest sum.

Answer 1

Solution

#include<iostream>
#include<climits>
using namespace std;
  
int max_subarray(int Arr[], 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 + Arr[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;
}
  
/* to test max_subarray*/
int main()
{
int Arr[] = {-2, -3, 4, -1, -2, 1, 5, -3};
int n = sizeof(Arr)/sizeof(Arr[0]);
int max_sum = max_subarray(Arr, n);
cout << "Maximum contiguous sum is " << max_sum;
return 0;
}

Screenshot

---

If there is anything missing or anything you want to add, please mention it

love to help

all the best