Comment by sjburt
4 years 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.
Fibonacci is generally more likely to take forever than stack overflow.