Recursive Calculation Of The Fibonacci Sequence Of a Given Number

fibonancci_numbers.c

#include <stdio.h>

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

main() {
   int n = 5;
	
   printf("Fibbonacci of %d: " , n);
	
   for(int i = 0;i<n;i++) {
      printf("%d ",fibbonacci(i));
   }
}