2 ms·
The Fibonacci sequence is also the textbook example of how badly a naive recursive implementation can perform, because the stack explodes.
by emmelaich 11y ago
The Fibonacci sequence is also the textbook example of how badly a naive recursive implementation can perform, because the stack explodes.