Fibbonachi series
#include <stdio.h>
int recursive(int n);
int iterative(int n);
int main()
{
int n,fib1,fib2;
printf("enter no of which u want fibbonachi:");
scanf("%d",&n);
fib1=recursive(n);
fib2=iterative(n);
printf("recursive fibonachi is %d\n",fib1);
printf("iterative fibonachi is %d",fib2);
return 0;
}
int recursive(int n)
{
if(n==1 || n==2)
{
return n-1;
}
else
{
return recursive(n-1)+recursive(n-2);
}
}
int iterative(int n)
{
int a=0,b=1;
for(int i=0;i<n-1;i++)
{
b=a+b;
a=b-a;
}
return a;
}
Comments
Post a Comment