example2_fibonacci.cpp

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
#include <iostream>

// Function to calculate factorial of n using recursion
int factorial(int n) {
    if (n == 0 || n == 1) {  // Base case
        return 1;
    } else {  // Recursive case
        return n * factorial(n - 1);
    }
}

int main() {
    int number = 5;
    std::cout << "Factorial of " << number << " is " << factorial(number) << std::endl;
    return 0;
}