From: Logan Capaldo <logancapaldo@...>
Date: 2005-12-13T16:40:42+09:00
Subject: Re: A question about recursive programming

--Apple-Mail-5--613872636
Content-Transfer-Encoding: 7bit
Content-Type: text/plain;
	charset=US-ASCII;
	delsp=yes;
	format=flowed


On Dec 12, 2005, at 12:52 PM, Hank Gong wrote:

> max function by recursive function.

Thats not so bad.

def max_by_recursion(arr)
        a1 = arr.dup
        m = a1.shift
        max_by_recursion1(m, a1)
end

def max_by_recursion1(current_max, arr)
        return current_max if arr.length == 0
        candidate = arr.shift
        candidate > current_max ? max_by_recursion1(candidate, arr) :  
max_by_recursion1(current_max, arr)
end


Of course in ruby we'd write

arr.inject { |max, curr| if curr > max then curr else max end }



--Apple-Mail-5--613872636--