Example: Fibonacci Series - Recursive Function in C

C
C++
C#
Java
Python
PHP
// Fibonacci Series - Recursive Function
#include <stdio.h>

// Function to calculate the Nth Fibonacci number recursively
int fibonacciRecursive(int n) {
    // Step 1: Define the base cases
    if (n <= 0) {
        return 0;
    } else if (n == 1) {
        return 1;
    }
    // Step 2: Define the recursive step
    else {
        return fibonacciRecursive(n - 1) + fibonacciRecursive(n - 2);
    }
}

int main() {
    int numTerms;

    // Step 1: Prompt user for the number of terms
    printf("Enter the number of terms for Fibonacci Series: ");
    scanf("%d", &numTerms);

    printf("Fibonacci Series (Recursive) up to %d terms: ", numTerms);

    // Step 2: Loop to print each term using the recursive function
    for (int i = 0; i < numTerms; i++) {
        printf("%d", fibonacciRecursive(i));
        if (i < numTerms - 1) {
            printf(", ");
        }
    }
    printf("\n");

    return 0;
}