Python Program for Largest Sum Contiguous Subarray
Write an efficient program to find the sum of contiguous subarray within a one-dimensional array of numbers which has the largest sum.
Maximum contiguous sum is -3
Above program can be optimized further, if we compare max_so_far with max_ending_here only if max_ending_here is greater than 0.
Please refer complete article on Largest Sum Contiguous Subarray for more details!