**Generate Fibonacci Series using Recursion**

**Generate Fibonacci Series using Recursion**

Write a C Program to generate Fibonacci Series using Recursion. Here’s simple Program to generate Fibonacci Series using Recursion in C Programming Language.

**Recursion : :**

**Recursion : :**

- Recursion is the process of repeating items in a self-similar way. In programming languages, if a program allows you to call a function inside the same function, then it is called a
of the function.**recursive call**

- The C programming language supports recursion, i.e., a function to call itself. But while using recursion, programmers need to be careful to define an exit condition from the function, otherwise it will go into an infinite loop.

- Recursive functions are very useful to solve many mathematical problems, such as calculating the factorial of a number, generating Fibonacci series, etc.

Here is the source code of the C Program to generate Fibonacci Series using Recursion. The C Program is successfully compiled and run on a Windows system. The program output is also shown below.

**SOURCE CODE : :**

**SOURCE CODE : :**

/* C Program to generate Fibonacci Series using Recursion */ #include<stdio.h> void fibonacci(int,int,int); int main() { int a=0,b=1,n; printf("Enter value of N :: "); scanf("%d",&n); printf("\nFibonacci Series upto [ %d ] Numbers are :: \n\n",n); fibonacci(a,b,n); printf("\n"); return 0; } void fibonacci(int a,int b, int n){ if(n!=0) { printf("%d ",a); fibonacci(b,a+b,n-1); } }

**OUTPUT : :**

**OUTPUT : :**

/* C Program to generate Fibonacci Series using Recursion */ Enter value of N :: 8 Fibonacci Series upto [ 8 ] Numbers are :: 0 1 1 2 3 5 8 13 Process returned 0

Above is the source code for C Program to generate Fibonacci Series using Recursion which is successfully compiled and run on Windows System.The Output of the program is shown above .

If you found any error or any queries related to the above program or any questions or reviews , you wanna to ask from us ,you may * Contact Us* through our contact Page or you can also comment below in the comment section.We will try our best to reach up to you in short interval.

**Thanks for reading the post….**