Recursion in C – Concept, Working & Examples

Recursion in C

Recursion DSA ka ek powerful concept hai jisme ek function khud ko hi call karta hai jab tak ek specific condition (base case) satisfy na ho jaye. Agar aap DSA roadmap for beginners follow kar rahe hain, to recursion samajhna bahut important hai kyunki ye advanced topics jaise trees, graphs aur dynamic programming me extensively use hota hai.

Beginners ke liye recursion thoda confusing ho sakta hai, lekin agar aap ise step-by-step samjhen aur examples ke saath practice karein, to ye kaafi easy lagne lagta hai. Is guide me hum recursion ko simple Hindi me explain karenge, taaki aap ise clearly samajh sakein.

📌 What is Recursion in C?

Recursion ek programming technique hai jisme function khud ko call karta hai. Har recursive function ke do important parts hote hain:

1. Base Case – Ye condition recursion ko stop karti hai

2. Recursive Case – Jahan function khud ko call karta hai

Agar base case define nahi hoga to program infinite loop me chala jayega.

📌 What You’ll Learn

• Recursion kya hota hai

• Base case & recursive case

• Call stack ka concept

• Real-life example

• C code examples

• Practice questions

⚙️ How Recursion Works (Simple Explanation)

Recursion ko samajhne ka sabse easy tarika hai “kaam ko chhote parts me todna”.

Example:
Factorial of 5 = 5 × 4 × 3 × 2 × 1

Isko recursion se likha ja sakta hai:
👉 n! = n × (n-1)!

Yaha function baar-baar khud ko call karta hai jab tak n = 1 na ho jaye.

💻 Recursion Program in C (Factorial Example)

#include <stdio.h>

int factorial(int n) {

    if (n == 0)   // Base Case

        return 1;

    else

        return n * factorial(n - 1); // Recursive Call

}

int main() {

    int num = 5;

    printf("Factorial = %d", factorial(num));

    return 0;

}

Fibonacci using Recursion (C)

#include <stdio.h>

int fibonacci(int n) {

    if (n == 0)

        return 0;

    else if (n == 1)

        return 1;

    else

        return fibonacci(n-1) + fibonacci(n-2);

}

int main() {

    int n = 6;

    printf("Fibonacci = %d", fibonacci(n));

    return 0;

}

🔄 Step-by-Step Execution

fact(5)
→ 5 × fact(4)
→ 5 × 4 × fact(3)
→ 5 × 4 × 3 × fact(2)
→ 5 × 4 × 3 × 2 × fact(1)
→ 5 × 4 × 3 × 2 × 1

👉 Final Answer: 120

🎯 Types of Recursion

1. Direct Recursion

Jab function directly khud ko call karta hai

2. Indirect Recursion

Jab ek function dusre function ko call karta hai aur wo wapas pehle ko call karta hai

3. Tail Recursion

Jab recursive call last operation hota hai

⚡ Recursion vs Iteration

Feature                               Recursion                         Iteration

Approach                             Function call                      Loop

Memory                               Zyada                                 Kam

Code                                   Short                                  Long

👉 Beginners ke liye recursion samajhna important hai, lekin practical use me iteration bhi zaroori hai.

🎯 Applications of Recursion

Recursion real-world programming me bahut use hota hai:

• Factorial calculation

• Fibonacci series

• Tree traversal

• Graph algorithms

• Divide and conquer algorithms

👉 Ye sab advanced DSA topics ka base hai

⚡ Advantages of Recursion

• Code short aur clean hota hai

• Complex problems easy ban jati hain

• Tree aur graph problems me useful

❌ Disadvantages of Recursion

• Memory zyada use karta hai (call stack)

• Slow ho sakta hai

• Infinite recursion ka risk

📈 Time Complexity (Example Based)

• Factorial → O(n)

• Fibonacci (simple recursion) → O(2^n)

👉 Optimization ke liye Dynamic Programming use hota hai

💡 Common Mistakes Beginners Karte Hain

• Base case define nahi karna

• Infinite recursion create karna

• Dry run na karna

👉 Solution: Har recursive function ka flow likhkar samjho

🚀 How to Master Recursion

1. Simple problems se start karo

2. Dry run karo (paper pe)

3. Call stack visualize karo

4. Practice questions solve karo

🔗 Internal Linking (SEO Boost)

Agar aap recursion seekh rahe hain to ye topics bhi zaroor padhein:

• 👉 DSA Roadmap for Beginners in Hindi

• 👉 Stack in Data Structure

• 👉 Binary Search in Data Structure

👉 Ye sab topics ek dusre se connected hain aur aapki DSA strong banate hain

🏁 Conclusion

Recursion ek powerful concept hai jo DSA me bahut important role play karta hai. Agar aap ise properly samajh lete hain to aap advanced topics ko bhi easily handle kar sakte hain.

Consistency aur practice ke saath recursion aapko difficult nahi lagega. Step-by-step approach follow karein aur har problem ko chhote parts me todkar solve karein.