Regarding code written in this video

[captian_n3m01]

in this if the case comes like every element in the array is negative then, according to the code it will generate maxsum as 0 but answer should be minimum negative element present in the array.
for example consider an array to be -1, -2, -5, -3. Then according to code answer will be 0. But if we look to array then answer should be -1. Right??

[Kartikkhariwal1 (Kartik Khariwal)]

Hey @captian_n3m01
correct.
that why u can write kadane algo as :

@Kartikkhariwal1

int max_subarray_sum(int a[], int n){
int current_max = 0;
int max_so_far = INT_MIN;
for(int i=0; i<n; i++){
… current_max = max(current_max + a[i], a[i]);
… max_so_far = max(current_max, max_so_far);
}
return max_so_far;
}

[Kartikkhariwal1 (Kartik Khariwal)]

Please mark it as resolved ,if this resolves ur query

[KartikKhariwal]

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.