Fibonacci series with recursive functions

 //Author : Niraj Bhagvat 

//Date : 02/07/2022

#include<stdio.h>
#include<conio.h>
int fibo(int);
void main()
{
    int x,i,c=0;
    clrscr();
    printf("\nHow many Fibonacci terms do you want to print? : ");
    scanf("%d",&x);
    printf("\nFibonacci Series : ");
    for(i=1; i<=x; i++)
    {
        printf("\n%d",fibo(c));
        c++;
    }
}
int fibo(int n)
{
    int f;
    if(n==0)
    {
        return 0;
    }
    else if(n==1)
    {
        return 1;
    }
    else
    {
        f=fibo(n-1)+fibo(n-2);
        return f;
    }
    getch();
}

Comments

Popular posts from this blog

Pointer to Matrix In C

Calculator in c programming language