problem 31(factorial of a given number using recursion)

 

problem 31(factorial of a given number using recursion)

#include<stdio.h>

int fibo(int n)

{

    if(n==0)return 0;

    if(n==1)return 1;

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

}

int main()

{

    int r;

  printf("Enter any number : ");

  scanf("%d",&r);

  for(int i=0;i<r;i++)

  {

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

  }

    return 0;

}