Write a c program to generate fibonacci series using recursion

• Fibonacci series starts from 0 ,1 and the next number should be sum of previous two numbers.
• 0+1=1, so the next number in Fibonacci series in c program is 1. 0 1 1 
• 0 1 1 2 3 5 8.. and so on.
• We have already seen this c program without using recursion.
• Now we will see how to generate fibonacci series by using recursion.
• A function called by itself : recursion. 
• Fibonacci series c programming using function

Program #1 : Write a C program to print / generate fibonacci series up to n numbers.  Take input from user. By using recursion

1. #include <stdio.h>
2. #include <stdlib.h>
4.  
5. // C program to generate  fibonacci series by using recursion 
6. //www.instanceofjava.com
7.  
8. //Function declaration
9. long long Printfibonacci(int num);
10.  
11.  
12. int main()
13. {
14.     int num;
15.     long long fibonacci;
16.      
17.     //Reads number from user to find nth fibonacci term
18.     printf("Enter any number to generaye fibonacci series up to ");
19.     scanf("%d", &num);
20.      
21.     printf("%d %d ",0,1);  
22.     Printfibonacci(num-2);//n-2 numbers. i.e 1 and 2 are printed already
23.      
24.     getch();
25. }
26.  
27.  
28. /**
29.  
30.  * Recursive function  
31. */
32. long long Printfibonacci(int num) 
33. {
34.     static int n1=0,n2=1,n3;  
35.     if(num>0){  
36.          n3 = n1 + n2;  
37.          n1 = n2;  
38.          n2 = n3;  
39.          printf("%d ",n3);  
40.          Printfibonacci(num-1); //Recursively calls Printfibonacci()
41.     }   
42. }

Output: