Sir, If All the elements in the subarray are negative than how can i use this kadane’s algorithm
Regarding Kadane's Algo
@gods_eye Kadanes algorithm works for all elements. If all negative elements are present the max subarray sum will be the highest value of the array even if it’s negative.
You may dry run this code to know how it works
int maxSubArraySum( int a[], 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 + a[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;
}