tail-rec decorator, well still blows the stack...
ssecorp
circularfunc at gmail.com
Mon Jul 21 23:01:35 EDT 2008
http://aspn.activestate.com/ASPN/Cookbook/Python/Recipe/496691
so I try it and when I run:
@Decorators.tail_recursion
def fibtr(n):
def fibt(a, b, n):
if n <= 1:
return b
else:
return fibt(b, a + b, n - 1)
if n == 0:
return 0
else:
return fibt(0, 1, n);
it still blows the stack. so what is the point? is it impossible to
get "real" tail-recursion in Python?
More information about the Python-list
mailing list