Subj : Re: question about finding sum of subset of contiguos elements of an array .
To   : comp.programming
From : Willem
Date : Thu Oct 06 2005 07:51 pm

Richard wrote:
) Given the subject line it is almost certain that he means subset of
) contiguous elements.  Shouldn't there be a limit to nit-picking?

Aww, lemme have a bit of fun with them CS-101 students. :-)

Anyway, one possible O(n) solution I can think of needs O(n) extra memory,
for an auxiliary array.  I can't think of a solution offhand that doesn't.
That doesn't mean there isn't one, of course, it just means it's been too
long since my days in CS class, and I have to use my big thumb instead. :)


SaSW, Willem
-- 
Disclaimer: I am in no way responsible for any of the statements
            made in the above text. For all I know I might be
            drugged or something..
            No I'm not paranoid. You all think I'm paranoid, don't you !
#EOT

.