//Write a C program to generate Fibonacci series
#include<stdio.h>#include<conio.h>
int fibo(int);
int count;
void main()
{
int i,n;
clrscr();
count=0;
printf("\nEnter n value : ");
scanf("%d",&n);
printf("\nFibonocci series");
for(i=1;i<=n;i++)
printf("\t%d",fibo(i));
printf("\n\nNumber of calculations : %d",count);
getch();
}
int fibo(int n)
{
count++;//in every recursive algorithm the base case is basic operation
if(n==1) return 0;
else if(n==2) return 1;
else return fibo(n-1)+fibo(n-2);
}
Output
No comments:
Post a Comment