If the array contains only negative elements, Kadane’s algorithm would not work for the max subarray sum problem. Does that leave us with only O(n^2) complexity for such negative element arrays?
Kadane's Algorithm
hello @antriksh_mangal
u can modify ur kadane implementation , to make it work for evry case.
some minute changes will be required in ur kadane.
first initilaise ur max sum with a[0] (in place of 0 u can take any index)
and inside for loop.
first update ur maximum and then update ur running sum
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.