Why is this blowing the stack, thought it was tail-recursive...
circularfunc at gmail.com
Sat Jul 12 18:20:58 CEST 2008
def fibt(a, b, n):
if n <= 1:
return fibt(b, a + b, n - 1)
if n == 0:
return fibt(0, 1, n);
and can memoization speed up this even more? tesintg with memoization
doesnt really say anything because it is so fast it is instant anyway.
(the classic easy-redable exponential fib-function can obv be helped
enormously with memoization though.)
More information about the Python-list