How to print the sub array instead of sum

#1

in the kadanes algo

#2

hello @kishoretaru
To print the subarray with the maximum sum, we maintain indices whenever we get the maximum su

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.

#4

Can you pls change the code of kadanes algo to print sub array index

#5

to print sub array in kadane’s algo
you have to use 3 variables
2 variable for left and right index of final subarray(ans) (left ,right)
and 1 is temporary variable (l)

you can use this function

int kadane(int a[], int n) 
{ 
    int ans = 0, currSum = 0; 
    int i; 
    int left=0,right=-1,l=0;
    for (i = 0; i < n; i++) 
    { 
        currSum = currSum + a[i]; 
        if (currSum < 0) {
            currSum = 0; 
            l=i+1;
        }
        if (ans < currSum){ 
            ans = currSum; 
            left=l;
            right=i;
        }
    } 
    for(int x=left;x<=right;x++)cout<<a[i]<<" ";
    return ans; 
}
#6

Hey @kishoretaru
What is the issue? How can I help you ?

#7

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.