Exploring Recursion in C++

Hello, fellow explorer! Today, we will unravel the mystery of "Recursion" — a captivating concept comparable to the patterns formed by two mirrors facing each other. Our goal is to decipher recursion, understand its inner workings, and master its application in C++.

Consider a stack of books. Want the bottom one? You'll need to remove each book above it, one by one. It's a recurring action — an example of recursion. In programming, recursion involves a function calling itself repeatedly until a specific condition is met, akin to descending stairs one step at a time until you reach the ground.

Here's a simple C++ function illustrating recursion:

#include <iostream>

void RecursiveFunction(int x) {
    if (x <= 0) {  // Termination condition --> base case
        std::cout << "Base case reached" << std::endl;
    } else {
        std::cout << x << " ";
        RecursiveFunction(x - 1); // Recursive function call --> recursive case
    }
}

int main() {
    RecursiveFunction(5);
    return 0;
}
/*Output: 5 4 3 2 1 Base case reached
*/

This function keeps calling itself with x getting lower by one until x <= 0, which is our base case. At this point, it stops the recursion.

The base case acts like a friendly signpost, telling the recursion when to stop. In our book stack example, reaching a point where no more books are left to remove serves as the signal. Similarly, x <= 0 is our base case in our function. The base case is crucial as it prevents infinite recursion and related errors.

The recursive case is an essential part of recursion — the rule responsible for creating smaller versions of the original problem. Each call brings us a step closer to the base case. Let's use the process of calculating a factorial as an illustrative example.

To find a factorial, we multiply a number by the factorial of the number minus one and repeat this process until we get to one (our base case):

#include <iostream>

int Factorial(int n) {
    if (n == 1 || n == 0) { // base case
        return 1;
    } else {
        return n * Factorial(n - 1); // recursive case
    }
}

int main() {
    std::cout << Factorial(3) << std::endl; // we expect 6 (3 * 2 * 1)
    return 0;
}

In this case, when we call Factorial(3), it returns 3 * Factorial(2), where Factorial(2) returns 2 * Factorial(1). As Factorial(1) is a base case, it returns 1. As a result, the whole recursion chain returns 3 * 2 * 1.