How to find the maximized contiguous SUM in an array (which contains +ve and -ve numbers)?
- by siva
ContigSum(i,j) as the sum of the contiguous elements a[i] through a[j], i<=j and a[] contains +ve & -ve numbers
Could you please tell me a time efficient solution to find maximized contiguous SUM in the array?