Fibonacci series with recursion.

#include <iostream>
using namespace std;

unsigned long long Fibonacci(int n) {
    if (n <= 1)
        return n;
    else
        return Fibonacci(n - 1) + Fibonacci(n - 2);
}

void PrintFibonacci(int n) {
    for (int i = 0; i < n; ++i) {
        cout << Fibonacci(i);
        if (i != n - 1) {
            cout << ", ";
        }
    }
}

int main() {
    int numberOfTerms = 20;
    
    cout << "Fibonacci series for " << numberOfTerms << " terms: " << endl;
    PrintFibonacci(numberOfTerms);

    return 0;
}