Fibonacci Series using Recursion

This program prints fibonacci series using recursion.

 

 

//Fibonacci Series using Recursion
 
 
/*
**********************
www.botskool.com
**********************
*/
 
#include<stdio.h>
#include<conio.h>
long term(int);
 
void main()
{ int i,n;
clrscr();
printf("How many terms do you wish to find?");
scanf("%d",&n);
 
printf("\nThe Series is : \n");
 
for(i=1;i<=n;i++)
 {
 printf(" %ld ",term(i));
 }
 
getch();
}
 
long term(int n)
{
if(n==1||n==2)
                return 1;
else
                return(term(n-1)+term(n-2));
return 0;
}
 
/*
**********************
www.botskool.com
**********************
*/

 

Output of the above program will be like this -

Output - Fibonacci series

 

Download source code.

 

 

Terms of Agreement:  
By using this code, you agree to the following terms-  
1) You may use this code in your own programs (and may compile it into a program and distribute it in compiled format for languages that allow it) freely and with no charge.  
2) You MAY NOT redistribute this code (for example to a web site) without written permission from us. Failure to do so is a violation of copyright laws.  
3) You may link to this code from another website, but ONLY if it is not wrapped in a frame.
4) You will abide by any additional copyright restrictions which may have placed in the code or code's description.

Tags: