5 ms·
>Rewriting a recursive Fibonacci function to use a loop with an explicit stack doesn't do anything about the growth of memory. Sort of. It means the amount of
by coldtea 5y ago
>Rewriting a recursive Fibonacci function to use a loop with an explicit stack doesn't do anything about the growth of memory.
Sort of. It means the amount of memory you can use is much bigger, and not constrained by the stack size.