From: Robert Dober <robert.dober@...>
Date: 2006-07-14T07:22:52+09:00
Subject: Re: Recursion and Ruby

------=_Part_15321_4846974.1152829370030
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: quoted-printable
Content-Disposition: inline

On 7/13/06, Christian Neukirchen <chneukirchen@gmail.com> wrote:
>
> 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)...


I challange this, as there is no algorithm to compute c**n in O(1) it is
O(log n).

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


--=20
Deux choses sont infinies : l'univers et la b=EAtise humaine ; en ce qui
concerne l'univers, je n'en ai pas acquis la certitude absolue.

- Albert Einstein

------=_Part_15321_4846974.1152829370030--