Sign in to track progress and bookmarks.
Recursion is when a function calls itself. It is a powerful conceptual tool for solving complex problems by breaking them into smaller, identical sub-problems. It is the language of Trees, Graphs, and Dynamic Programming.
StackOverflowException as the stack runs out of memory.public int Factorial(int n) {
if (n <= 1) return 1; // Base Case
return n * Factorial(n - 1); // Recursive Step
}Every time a function calls itself, a new **Stack Frame** is added to the memory. If the recursion is 1 million levels deep, your app will crash. This is why we sometimes prefer **Iterative** (loop-based) solutions for simple problems.
Q: "What is 'Tail Call Optimization' and does C# support it?"
Architect Answer: "Tail Call Optimization occurs when the recursive call is the *very last* thing the function does. In theory, the compiler can reuse the current stack frame instead of adding a new one, making the recursion as fast as a loop. While the 64-bit JIT compiler in .NET DOES support this for certain IL patterns, it is not guaranteed. For critical, deep recursion, a senior dev should always consider using an explicit **Stack
Quizzes linked to this course—pass to earn certificates.
On this page
1. The Two Pillars of Recursion 2. The Call Stack 4. Interview Mastery