C LANGUAGE

1.Write a recursive function to obtain the first 25 numbers of a Fibonacci sequence.

A.

ITERATIVE METHOD:
#include<stdio.h>
void main()
{
int n,i,a=0,b=1,c=0;
printf("Enter Nth term of Fibonacci series : ");
scanf("%d",&n);
printf("\n %d %d  ",a,b); //for printing first two numbers
for(i=0;i<n;n--)  // for printing from 3rd number in series
{
 c=a+b;
 a=b;
 b=c;
 printf("%d ",c);
}
}
RECURSIVE METHOD:
#include<stdio.h>
void main()
{
int n,i,a=0,b=1,c=0;
printf("Enter Nth term of Fibonacci series : ");
scanf("%d",&n);
printf("\n %d %d  ",a,b); //for printing first two numbers
fib(n);
}
int fib(int k)
{
int c;
static long int x=0,y=1;
c=x+y;
 x=y;
 y=c;
if(k>0)
{
printf("%d ",c);
return(fib(k-1));
}
else
return 0;
}