Fibonacci series recursion error
__peter__ at web.de
Sat Apr 30 08:32:55 CEST 2011
> Ian Kelly wrote:
>> since the fact is that if
>> the function were properly coded, the call stack for fib(20) would
>> never be more than 20 entries deep at any one time.
> Not so much... and much more !....
> ... because each recursion level 'return' calls fib() twice, and each
> of those calls fib() twice, and you get the point...
I don't understand what you are trying to say -- but it's wrong ;)
More information about the Python-list