Recursion in C

1What is Recursion?✨

Recursion is a programming technique where a function calls itself to solve smaller instances of a problem. It's useful for tasks that can be broken down into simpler, similar tasks.

2Why Learn Recursion?🎯

• ✓ Simplifies code for complex problems
• ✓ Makes certain algorithms easier to implement
• ✓ Helps in solving problems like factorials, Fibonacci, and tree traversals
• ✓ Enhances problem-solving skills and logical thinking

3Your First Recursive Function💡

Let's create a simple recursive function to calculate the factorial of a number.

int factorial(int n) {
    if (n == 0) 
        return 1;
    else 
        return n * factorial(n - 1);
}

This function multiplies the number by the factorial of the previous number until it reaches zero.

4Understanding Base Case and Recursive Case🚀

• Every recursive function needs:
• A base case: the condition under which the function stops calling itself.
• A recursive case: the part where the function calls itself.

In the factorial example, the base case is when n equals 0. The recursive case is n * factorial(n - 1).

5Common Uses of Recursion🔍

• Recursion can be used for various problems, including:
• Calculating Fibonacci numbers
• Traversing data structures like trees
• Solving puzzles such as the Tower of Hanoi

6Example of Fibonacci Sequence⭐

Here's how to compute Fibonacci numbers using recursion:

int fibonacci(int n) {
    if (n <= 1) 
        return n;
    return fibonacci(n - 1) + fibonacci(n - 2);
}

This function computes the nth Fibonacci number by summing the two preceding numbers in the sequence.

7Practicing Recursion🧩

• Try creating your own recursive functions!
• Calculate the sum of an array
• Implement a binary search
• Solve the Tower of Hanoi problem

Recursion can seem tricky at first, but with practice, you’ll become more comfortable with it!