Revision as of 03:25, 30 March 2008 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,724 edits add an example ← Previous edit		Revision as of 03:26, 30 March 2008 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,724 edits m →Kadane's algorithm: add section break Next edit →
Line 16: </source> ==Generalizations== Similar problems may be posed for higher dimensional arrays, but their solution is more complicated.

Maximum subarray problem: Difference between revisions