C

fibonacci series in c using recursion

#include<stdio.h>
int main()
{
int first=0, second=1, i, n, sum=0;
printf("Enter the number of terms: ");
scanf("%d",&n);
//accepting the terms
printf("Fibonacci Series:");
for(i=0 ; i<n ; i++)
{
if(i <= 1)
{
sum=i;
}
//to print 0 and 1
else
{
sum=first + second;
first=second;
second=sum;
//to calculate the remaining terms.
//value of first and second changes as new term is printed.
}
printf(" %d",sum)
}
return 0;
}

recursive fibonacci in c

int fibbonacci(int n) 
{
   if(n == 0 || n == 1)
      return n;
   else
      return (fibbonacci(n-1) + fibbonacci(n-2));
}