Can you explain Kadane's algorithm to find sub array having maximum sum value for all negative array numbers?
For example:
Array - [ -10, -10, -10] should return -10. But normally Kadane's algorithm will return 0 for this array. So i want to know how to make it work for all negative array numbers.
