------art_38400_29327320.1184338083533
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

>
> by Harlan
>
> Given an array of integers, find the sub-array with maximum sum.  For
> example:
>
>         array:              [-1, 2, 5, -1, 3, -2, 1]
>         maximum sub-array:  [2, 5, -1, 3]


Just to confirm the problem. Wouldn't the maximum sub array be

[2, 5, 3] ?


Matt

------art_38400_29327320.1184338083533--