Recursion in Programming Explained Simply with Examples (Beginner to Interview Level)

Recursion is one of the most important and interesting concepts in programming. Many beginners find it confusing, but once you understand it clearly, it becomes very powerful for solving complex problems easily.

What is Recursion?

Recursion is a technique where a function calls itself to solve a problem. The problem is divided into smaller subproblems, and the same function is used again and again until a base condition is reached.

Real Life Example of Recursion

Think of two mirrors placed in front of each other. You see the same image repeating again and again. Similarly, in recursion, a function keeps calling itself.

Basic Structure of a Recursive Function

Every recursive function has two main parts:

• Base Case: The condition where recursion stops.
• Recursive Case: The part where the function calls itself.

Simple Example: Factorial Using Recursion

int factorial(int n) {
    if(n == 1)   // Base Case
        return 1;
    else
        return n * factorial(n - 1);  // Recursive Call
}

How Recursion Works (Step by Step)

When factorial(4) is called, it becomes:

• 4 * factorial(3)
• 3 * factorial(2)
• 2 * factorial(1)
• factorial(1) returns 1 (base case)

Advantages of Recursion

• Makes code shorter and cleaner
• Easy to solve problems like tree traversal
• Useful in divide and conquer algorithms

Disadvantages of Recursion

• Uses more memory due to function calls
• Can be slower than loops
• Risk of stack overflow if base case is missing

Recursion vs Iteration

Recursion	Iteration
Function calls itself	Uses loops
More memory usage	Less memory usage
Easy to understand for some problems	Faster in many cases

Recursion in Interviews

Common interview questions on recursion include:

• Factorial of a number
• Fibonacci series
• Reverse a string
• Tree traversal

Conclusion

Recursion is a powerful concept that helps solve problems in a clean and logical way. Once you understand base cases and recursive calls, you can easily master advanced topics like trees and divide-and-conquer algorithms.

Next Post: Binary Search Algorithm Explained with Example and Code