Example: Fibonacci Series - Recursive in C++

C
C++
C#
Java
Python
PHP
// Fibonacci Series - Recursive
#include <iostream>
using namespace std;

// Function to calculate the nth Fibonacci number
int fibonacci(int n) {
    // Step 1: Define base cases
    if (n <= 1) {
        return n; // F(0) = 0, F(1) = 1
    }
    // Step 2: Recursive step
    return fibonacci(n - 1) + fibonacci(n - 2);
}

int main() {
    int n_terms;
    cout << "Enter the number of terms: ";
    cin >> n_terms;

    cout << "Fibonacci Series: ";

    // Step 3: Iterate and call the recursive function for each term
    for (int i = 0; i < n_terms; ++i) {
        cout << fibonacci(i);
        if (i < n_terms - 1) {
            cout << ", ";
        }
    }
    cout << endl;

    return 0;
}