Fibonacci Sequence using Recursion
/* Program : Fibonacci using Recursion
by S.V.Koratkar
*/
#include<stdio.h>
#include<conio.h>
int fibo(int i); //Function Declaration
void main()
{
int i,n;
clrscr();
printf("\nEnter Length ");;
scanf("%d",&n);
printf("\nFibonacci Sequence till %d is \n\n",n);
for(i=0;i<n;i++)
{
printf("%d\t",fibo(i)); //Function Calling
}
getch();
}
int fibo(int i) //Function definition
{
if(i==0)
{
return 0;
}
if(i==1)
{
return 1;
}
else
{
return fibo(i-1)+fibo(i-2);
}
}
/*
----------------------OUTPUT--------------------------
Enter Length 9
Fibonacci Sequence till 9 is
0 1 1 2 3 5 8 13 21
*/
by S.V.Koratkar
*/
#include<stdio.h>
#include<conio.h>
int fibo(int i); //Function Declaration
void main()
{
int i,n;
clrscr();
printf("\nEnter Length ");;
scanf("%d",&n);
printf("\nFibonacci Sequence till %d is \n\n",n);
for(i=0;i<n;i++)
{
printf("%d\t",fibo(i)); //Function Calling
}
getch();
}
int fibo(int i) //Function definition
{
if(i==0)
{
return 0;
}
if(i==1)
{
return 1;
}
else
{
return fibo(i-1)+fibo(i-2);
}
}
/*
----------------------OUTPUT--------------------------
Enter Length 9
Fibonacci Sequence till 9 is
0 1 1 2 3 5 8 13 21
*/