Kadane algorithm

#1

can we find the position of the largest sum through kadane algo?

#2

hello @goyalvivek

To print the subarray with the maximum sum, we maintain indices whenever we get the maximum sum

int maxSubArraySum(int a[], int size) 
{ 
int max_so_far = INT_MIN, max_ending_here = 0, 
   start =0, end = 0, s=0; 

for (int i=0; i< size; i++ ) 
{ 
    max_ending_here += a[i]; 

    if (max_so_far < max_ending_here) 
    { 
        max_so_far = max_ending_here; 
        start = s; 
        end = i; 
    } 

    if (max_ending_here < 0) 
    { 
        max_ending_here = 0; 
        s = i + 1; 
    } 
} 
cout << "Maximum contiguous sum is "
    << max_so_far << endl; 
cout << "Starting index "<< start 
    << endl << "Ending index "<< end << endl;

}

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.