midRecursion
Tail Call Optimization (TCO) explained.
Updated Apr 28, 2026
Short answer
A compiler optimization where a tail call is converted to a jump, avoiding a new stack frame.
Deep explanation
Intermediate recursion focuses on optimization and advanced patterns like backtracking. A compiler optimization where a tail call is converted to a jump, avoiding a new stack frame.
Real-world example
File system crawlers (scanning directories and sub-directories).
Common mistakes
- Thinking all recursion is tail-recursive
- the result must not depend on local calculations after the call.
Follow-up questions
- Does Python support TCO?