3 ms·
A naive fib(n) only needs stack depth of about n -- it takes a long time but doesn't need to go very deep.
by abecedarius 8y ago
A naive fib(n) only needs stack depth of about n -- it takes a long time but doesn't need to go very deep.
- e12e 8y agoYou're right about Fibonacci - a naive fib(1000) takes a long time to eventually overflow the stack in python. But fact(1000) quickly crashes. Which is a shame as python has a full(?) number tower and has no problem calculating 1000!