From: C Erler <erlercw@...>
Date: 2006-05-29T04:29:28+09:00
Subject: Re: Fast Fibonacci method

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

On 28/05/06, Nuralanur@aol.com <Nuralanur@aol.com> wrote:
>
> Why are you interested in the millionth Fibonacci number, actually  ?
>

I just chose a relatively high number to give some comparison of asymptotic
performance (performance as the input value goes to infinity).  If you have
an algorithm that loses with low numbers like one million, but starts to
beat the code I gave at some higher input value (and gives perfectly correc=
t
results without rounding errors), please let me know, since a hybrid of the
two can be used.

------=_Part_230583_32967797.1148844564016--