hello-algo/en/codes/c/chapter_computational_complexity/recursion.c

/**
 * File: recursion.c
 * Created Time: 2023-09-09
 * Author: Gonglja (glj0@outlook.com)
 */

#include "../utils/common.h"

/* Recursion */
int recur(int n) {
    // Base case
    if (n == 1)
        return 1;
    // Recurse: make a recursive call
    int res = recur(n - 1);
    // Unwind: return the result
    return n + res;
}

/* Simulate recursion using iteration */
int forLoopRecur(int n) {
    int stack[1000]; // Use a large array to simulate a stack
    int top = -1;    // Top-of-stack index
    int res = 0;
    // Recurse: make a recursive call
    for (int i = n; i > 0; i--) {
        // Simulate recursive calls by pushing onto the stack
        stack[1 + top++] = i;
    }
    // Unwind: return the result
    while (top >= 0) {
        // Simulate unwinding by popping from the stack
        res += stack[top--];
    }
    // res = 1+2+3+...+n
    return res;
}

/* Tail recursion */
int tailRecur(int n, int res) {
    // Base case
    if (n == 0)
        return res;
    // Tail-recursive call
    return tailRecur(n - 1, res + n);
}

/* Fibonacci sequence: recursion */
int fib(int n) {
    // Base cases: f(1) = 0, f(2) = 1
    if (n == 1 || n == 2)
        return n - 1;
    // Recursive calls: f(n) = f(n-1) + f(n-2)
    int res = fib(n - 1) + fib(n - 2);
    // Return the result f(n)
    return res;
}

/* Driver code */
int main() {
    int n = 5;
    int res;

    res = recur(n);
    printf("\nSum from the recursive function, res = %d\n", res);

    res = forLoopRecur(n);
    printf("\nSum from simulating recursion with iteration, res = %d\n", res);

    res = tailRecur(n, 0);
    printf("\nSum from the tail-recursive function, res = %d\n", res);

    res = fib(n);
    printf("\nFibonacci term %d is %d\n", n, res);

    return 0;
}