Fibonacci Series in C

Fibonacci Series in C

In the Fibonacci series, the following number is the sum of the preceding two numbers, for example, 0, 1, 1, 2, 3, 5, 8, 13, 21, and so on. 0 and 1 are the first two numbers in the Fibonacci sequence.

The Fibonacci series programme can be written in two ways:

1. Without recursion, Fibonacci Series.
2. Recursion in the Fibonacci Series.

Fibonacci Series in C without recursion.

#include<stdio.h> 

#include<conio.h>    

void main()    

{    

 int n1=0,n2=1,n3,i,number;    

 printf("Enter the number of elements:");    

 scanf("%d",&number);    

 printf("\n%d %d",n1,n2);//printing 0 and 1    

 for(i=2;i<number;++i)//loop starts from 2 because 0 and 1 are already printed    

 {    

  n3=n1+n2;    

  printf(" %d",n3);    

  n1=n2;    

  n2=n3;    

 }  

  getch();  

}   

Fibonacci Series in C

 

Expected Output:-  

Enter the number of elements:15

0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 

Recursion in the Fibonacci Series.

#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);    

         printFibonacci(n-1);    

    }    

}    

int main(){    

    int n;    

    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    

  return 0;  

 }  

Fibonacci Series in C

Output:-  

Enter the number of elements:15

0 1 1 2 3 5 8 13 21 34 55 89 144 233 377