Maximum subarray problem: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

8 January 2015

8 January 2014

29 August 2012

  • curprev 03:4203:42, 29 August 2012 en>David Eppstein 4,226 bytes +4,226 Undid revision 509699314 by DrMorcos (talk) does too: max_subarray([-2, 1, -3, 4, -1, 2, 1, -5, 4]) returns 6, correctly. Advantage of Python over pseudocode is you can test it.
Retrieved from "https://en.formulasearchengine.com/wiki/Maximum_subarray_problem"