#include<stdio.h>
#include<conio.h>
void printFibonacci(int n) // function to calculate the fibonacci series of a given number.
{
static int n1=0,n2=1,n3; // declaration of static variables.
if(n>0){
n3 = n1 + n2;
n1 = n2;
n2 = n3;
printf(“%d “,n3);
printFibonacci(n-1); //calling the function recursively.
}
}
void main(){
int n;
clrscr();
printf(“Enter the number of elements: “);
scanf(“%d”,&n);
printf(“Fibonacci Series: “);
printf(“%d %d “,0,1);
printFibonacci(n-2);//n-2 because 2 numbers are already printed
getch();
}
BrindhaPrathaban Answered question June 29, 2023
Fibonacci Series using recursion in C
- #include<stdio.h>
- void printFibonacci(int n){
- static int n1=0,n2=1,n3;
- if(n>0){
- n3 = n1 + n2;
- n1 = n2;
- n2 = n3;
- printf(“%d “,n3);
BrindhaPrathaban Answered question June 29, 2023
Fibonacci Series using recursion in C
- #include<stdio.h>
- void printFibonacci(int n){
- static int n1=0,n2=1,n3;
- if(n>0){
- n3 = n1 + n2;
- n1 = n2;
- n2 = n3;
- printf(“%d “,n3);
Vishalini.R Answered question June 29, 2023