Fibonacci upto n using recursion

fib.c

#include <stdio.h>

int fact(int n);

int main(){
  int num;
  scanf("%d", &num);
  int i = 0;
  
  while(i != num){                    //calling the factorial function upto n times
    printf("%d \n", fact(i));
    i = i + 1;         

  }                                     



  return 0;
}


int fact(int n){
  if (n == 0 || n == 1)
    return n;
  else
    return (fact(n-1) + fact(n-2));
}