Maximum subarray problem: Difference between revisions

Revision as of 09:53, 8 April 2023

Revision as of 12:45, 22 April 2023

Line 1:

{{Short description|Problem in computer science}}

{{pp-dispute|small=yes}}

[[File:Maximum Subarray Visualization.svg|thumbnail|Visualization of how sub-arrays change based on start and end positions of a sample. Each possible contiguous sub-array is represented by a point on a colored line. That point's y-coordinate represents the sum of the sample. Its x-coordinate represents the end of the sample, and the leftmost point on that colored line represents the start of the sample. In this case, the array from which samples are taken is [2, 3, -1, -20, 5, 10]. ]]