1D Maximum Subarray: Revision history

28 April 2023

• curprev 09:1009:10, 28 April 2023‎ Admin talk contribs‎ 2,453 bytes −221‎ No edit summary

10 April 2023

• curprev 08:2308:23, 10 April 2023‎ Admin talk contribs‎ 2,674 bytes −22‎ No edit summary

15 February 2023

• curprev 14:4614:46, 15 February 2023‎ Admin talk contribs‎ 2,696 bytes −15‎ No edit summary
• curprev 13:0413:04, 15 February 2023‎ Admin talk contribs‎ 2,711 bytes +14‎ No edit summary
• curprev 12:0312:03, 15 February 2023‎ Admin talk contribs‎ 2,697 bytes −11‎ No edit summary

• curprev 10:2310:23, 15 February 2023‎ Admin talk contribs‎ 2,708 bytes +2,708‎ Created page with "{{DISPLAYTITLE:1D Maximum Subarray (Maximum Subarray Problem)}} == Description == Given an array $A$ of length $n$, find $i, j$ with $1\leq i \leq j \leq n$ maximizing $\sum^j_{x=i} A(x)$, that is, find a contiguous subarray of $A$ of maximum sum == Related Problems == Generalizations: Maximum Subarray Related: 2D Maximum Subarray, Maximum Square Subarray == Parameters == <pre>n: length of array</pre> == Table of Algorithms == {| class="wikitable..."