/*
	Fibonacci Series Using Recursion
	     Made By  Gaurang Sinha
	      gaurang85.tripod.com
*/
	
#include<stdio.h>
#include<conio.h>

long int fibbo(int);

void main()
{
int n,i;
long int f;
clrscr();
printf("\nEnter No Of Fibonacci Numbers Reqd : ");
scanf("%d",&n);
printf("\nElement 1 : 0");
for(i=0;i<=n-2;i++)
{
	f=fibbo(i);
	printf("\nElement %d : %ld",i+2,f);
}
getch();
}

long int fibbo(int x)
{
int y;
	if(x<2)
	{	return 1;	}
	else
{
  y=(fibbo(x-1)+fibbo(x-2));
	return y;
}
}