From: Ari Brown <ari@...>
Date: 2007-07-14T03:29:14+09:00
Subject: Re: [QUIZ] Maximum Sub-Array (#131)

<snip>

Being a nub at life, liberty, and ruby, what is the best way to  
search it? Would it be to go and sum up the elements in every  
possible array (ie, [abc] => [a]. [b]. [c]. [ab]. [bc])? Because that  
seems like it would get very CPU consuming with larger arrays.

aRi
--------------------------------------------|
If you're not living on the edge,
then you're just wasting space.