Program:
#include<stdio.h>
int fibbonacci(int n);
int main()
{
int i,n;
printf("Enter no. of elements: ");
scanf("%d",&n);
printf("Fibbonacci of %d:\n " , n);
for(i=0;i<n;i++)
{
printf("%d ",fibbonacci(i));
}
return 0;
}
int fibbonacci(int n)
{
if(n == 0)
{
return 0;
}
else if(n == 1)
{
return 1;
}
else
{
return (fibbonacci(n-1) + fibbonacci(n-2));
}
}
Output:
#include<stdio.h>
int fibbonacci(int n);
int main()
{
int i,n;
printf("Enter no. of elements: ");
scanf("%d",&n);
printf("Fibbonacci of %d:\n " , n);
for(i=0;i<n;i++)
{
printf("%d ",fibbonacci(i));
}
return 0;
}
int fibbonacci(int n)
{
if(n == 0)
{
return 0;
}
else if(n == 1)
{
return 1;
}
else
{
return (fibbonacci(n-1) + fibbonacci(n-2));
}
}
No comments:
Post a Comment