Greetings monks!

A problem has come to my attention. Given an arbitrary sized array of integers in an arbitrary order, whats the sequence of consecutive integers that results in the largest sum.*

array = {3 2 8 9 -25 5 8 4 4 -3 5 3 -10}

largestsubset = {5 8 4 4 -3 5 3}

#!/usr/bin/perl

use strict;
use warnings;

my @array = qw( 3 2 8 9 -25 5 8 4 4 -3 5 3 -10 );

my $length = scalar(@array);
my $sidx;
my $eidx;
my $max = 0;

my $start = 0;
while($start < $length) {
        my $sum = $array[$start];
        for(my $end = ($start + 1); $end < $length; $end++) {
                $sum += $array[$end];
                if($sum > $max) {
                        $sidx = $start;
                        $eidx = $end;
                        $max = $sum;
                }
        }
        $start++;
}
[download]

Start: 5 End: 11

Now of course that isn't pretty, but it works nicely for smaller sets. Only problem I could see is if the sets grow to an unreasonable size. Are there any more elegant ways of going at this?

One of my ideas was watching the value of sum and if it reached a negative value then break out of the inner loop.