Define a recursive function to calculate Fibonacci numbers I

Define a recursive function to calculate Fibonacci numbers. In main(), assign N with an integer (positive and less than 20) from standard input. Based on the value of N, call the recursive function and output the N^th Fibonacci number: Fibonacci (N) = Fibonacci(N-1) + Fibonacci(N-2)

Solution

#include <stdio.h>

#include <conio.h>

int fibonacci(int N);

int main(){

    int N, counter;

    printf(\"Enter number of N in Fibonacci series: \");

    scanf(\"%d\", &N);

  

    printf(\"Fibonacci series till %d Nth terms\ \", N);

    for(counter = 0; counter < N; counter++){

        printf(\"%d \", fibonacci(counter));

    }

    getch();

    return 0;

}

/*

* Function to calculate Nth Fibonacci number

* fibonacci(N) = fibonacci(N - 1) + fibonacci(N - 2);

*/

int fibonacci(int N){

    /* Exit condition of recursion*/

    if(N < 2)

       return N;

    return fibonacci(N - 1) + fibonacci(N - 2);

}