>>>>> this works? up to what index?
>>> Up to 34 or so in windows.
> 
>> And in O(1) time instead of O(n)...
> 
>   Up to index 34 you could just make a table which you index with the
> number and that would also be O(1), and probably with a faster factor.

That's also true...


I can't actually think of a *use* for Fibonacci numbers, come to think 
of it.

Post a reply to this message