Fibonacci series by RECURSION 🫨🫨👍

 Code is written and implemented :

Himanshu Tiwari

#include<stdio.h>

int fib(int n){

    if(n==1 || n==2) return 1;

    else{

        return fib(n-1)+fib(n-2);

    }

}

void fibo(int n){

    for(int i=1; i<=n; i++){

        printf("%d  ",fib(i));

    }

}

int main(){

 int n;

 printf("enter number to print series : ");

 scanf("%d",&n);

 fibo(n);

    return 0;

}

output : ---