//this code is designed by codenation.
//5:58 1/11/2021
#include<stdio.h>
int searchfibo();
int n,i=0,nextterm=0,sum=0,temp=1,item,element;
int main()
{
printf("enter the number of elements in fibonacci series :\n");
scanf("%d",&n);
printf("enter the item to find in fibonacci series :\n");
scanf("%d",&item);
searchfibo();
return 0;
}
int searchfibo()
{
element=nextterm;
if(i==n)
{
printf("item not present in list for %d elements\n",n);
return 0;
}
else
{
if(element==item)
{
printf("item %d found in series at location %d.\n",item,i+1);
return 0;
}
nextterm=sum+temp;
temp=sum;
sum=nextterm;
i++;
searchfibo();
}
}
//this code is developed by codenation.
Comments
Post a Comment