4 ms·
I've always hated how that's used as an example of recursive programming in early programming education. Invariably, students try a large n, get a stack overflo
by sjburt 6y ago
I've always hated how that's used as an example of recursive programming in early programming education. Invariably, students try a large n, get a stack overflow and conclude that recursion is inefficient, leads to mysterious errors, and must be avoided.
- saagarjha 6y agoFibonacci is generally more likely to take forever than stack overflow.