From: Christian Neukirchen <chneukirchen@...>
Date: 2006-07-14T05:52:41+09:00
Subject: Re: Recursion and Ruby

Daniel Martin <martin@snowplow.org> writes:

> "Erik Veenstra" <erikveen@gmail.com> writes:
>
> (Of course, now someone will respond with one of the O(log(n))
> algorithms for computing fib(n))

Given you have an reasonably exact approximation of the square root of 5,
this can be done O(1)...

-- 
Christian Neukirchen  <chneukirchen@gmail.com>  http://chneukirchen.org