Program To trace terms of Fibonacci series usng recursion Function in C Programming. 



//To trace terms of Fibonacci series usng recursion.

#include
#include

main()
{
int n,i;
clrscr();
printf("Input term number ");
scanf("%d",&n);
printf("Fibonacci series upto %d terms is \n",n);
for(i=1;i<=n;i++)
printf("%d ",fibo(i));
}
//Started Function
//www.lernc.blogspot.com
fibo(int n)
{
int f;
if(n==1 || n==2)
return(1);
else
{
f=fibo(n-1)+fibo(n-2);
}
return(f);
}
//www.lernc.blogspot.com

1 comment:

  1. AnonymousJuly 19, 2011 at 11:39 AM

    #include
    #include

    void main()
    {static int a,b,sum1;
    int sum=1,n;
    for(n=1;n<=20;n++)
    {sum1=a+b;
    sum=sum1+sum;
    a=sum1;
    b=sum;
    printf("%d %d ",sum1,sum);
    }
    getch();






    }

    ReplyDelete