Why is this blowing the stack, thought it was tail-recursive...
steve at REMOVE-THIS-cybersource.com.au
Sun Jul 13 08:56:20 CEST 2008
On Sat, 12 Jul 2008 19:25:18 -0400, Terry Reedy wrote:
> ssecorp wrote:
>> def fib(n):
>> def fibt(a, b, n):
>> if n <= 1:
>> return b
>> return fibt(b, a + b, n - 1)
>> if n == 0:
>> return 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.
> Except for the fact that a+b gets slower as a and b get bigger, this
> would already be linear time in n. Memoization (here by means of a
> linear list) only helps if the list is preserved and one makes repeated
> requests for various fib values.
> I am just curious what input you tried that blew the stack? It had to
> be pretty large.
No, not really. Try it for yourself: on my system, I get RuntimeError:
maximum recursion depth exceeded with fib(999).
fib(999) is a large number, with 208 digits, but not that large:
More information about the Python-list