Introduction to Microservice Architecture Using SpringBoot - Part 1

 Write a C program to generate nth Fibonacci term using recursion

 #include<stdio.h>  
 int fibo(int n)  
 {  
      if(n==0 || n==1)  
           return n;  
      else  
           return(fibo(n-1)+fibo(n-2));  
 }  
 int main()  
 {  
      int n,i;  
      printf("enter the total terms = ");  
      scanf("%d",&n);  
      for(i=0;i<n;i++)  
      {  
           printf("%d\n",fibo(i));  
      }  
      return 0;  
 }  

OUTPUT :