From: Douglas McNaught <doug@...>
Date: 2006-07-14T07:44:40+09:00
Subject: Re: Recursion and Ruby

"Robert Dober" <robert.dober@gmail.com> writes:

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

OT, but...

http://mathforum.org/library/drmath/view/52686.html

-Doug