Chapter 5 solutions Problem[J][c]

Question-Write a recursive function to obtain the first 25 numbers of a 
Fibonacci sequence. In a Fibonacci sequence the sum of two 
successive terms gives the third term.Following are the first
few terms of the Fibonacci sequence: 
1 1 2 3  5 8 13 2134 55 89..
Solution-
This question urges for only the recursive way but i like to post non- recursive way as well.so, i want to show the non-recursive way.check this out.

Non-Recursive way to print fibonacci series  

#include<stdio.h>
int main()
{
int n=29;
printf("Enter the number of fibonacci series you want\n");
scanf("%d",&n);
fibonacci(n);
return 0;
}
fibonacci(int n)
{
int i,sum,first=0,second=1;
for(i=0;i<=n;i++)
{
if(i==0||i==1)
sum=i;
else
{
sum=first+second;
first=second;
second=sum;
}
printf("%d ",sum);
}
}

Recursive way to print Fibonacci series

#include<stdio.h>
int main()
{
int n,i;
printf("Enter the number of terms of fibonacci you want\n");
scanf("%d",&n);
for(i=0;i<=n;i++)
{
printf("%d ",fibonacci(i));
}
return 0;
}
fibonacci(int i)
{
int sum;
if(i<=1)
sum=i;
else
sum=fibonacci(i-1)+fibonacci(i-2);
return(sum);
}