Subj : question about finding sum of subset of contiguos elements of an array .
To   : comp.programming
From : maadhuu
Date : Thu Oct 06 2005 03:14 pm

hello ,
Given an array of positive and negative numbers, how do you come with an
algorithm to find the subset of elements that have the highest sum .

I can think of implementing an O(n^2) algorithm, but how do you do it in
time less than that ??
Thanking you,
Yours sincerely
Maadhuu

.