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...
(not to mention, its not properly coded) -- http://mail.python.org/mailman/listinfo/python-list
