From: David Chelimsky <dchelimsky@...>
Date: 2007-07-14T01:04:43+09:00
Subject: Re: [QUIZ] Maximum Sub-Array (#131)

On 7/13/07, David Chelimsky <dchelimsky@gmail.com> wrote:
> On 7/13/07, Matt Greer <matt.e.greer@gmail.com> wrote:
> > 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]
>
> What are the criteria for selecting from multiple possibilities? For example:
>
> [1,2,3,-7,6]

Or this:

[1,2,3,-6,6]

options

[1,2,3]
[1,2,3,-6,6]
[6]


>
> options:
>
> [1,2,3]
> [6]
>
> Does it matter?
>
>