From: Matt Greer <matt.e.greer@...>
Date: 2007-07-13T23:49:01+09:00
Subject: Re: [QUIZ] Maximum Sub-Array (#131)

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

On 7/13/07, Matt Greer <matt.e.greer@gmail.com> wrote:
>
>
>
> > 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] ?
>

Duh. Nevermind :) Maximum sub *array*. I get it. Carry on. Don't mind me...

Matt

------=_Part_38420_9515600.1184338133409--