Revision as of 09:34, 13 May 2011 edit 59.90.253.49 (talk) Added a link for this algo from programming pearls ← Previous edit		Revision as of 09:47, 13 May 2011 edit undo 59.90.253.49 (talk) Changed -INFINITY to 0 as starting value according to programming pearls .The algorithm always insures that sequence will always have a positive number so our maximum sum will always be greater than or equal to zero. Next edit →
Line 9: Kadane's Algorithm(array[1..n]) begin (maxSum, maxStartIndex, maxEndIndex) := (~~-INFINITY~~0, 0, 0) currentMaxSum := 0 currentStartIndex := 1

Maximum subarray problem: Difference between revisions