Untitled

mail@pastecode.io avatar
unknown
c_cpp
a year ago
273 B
1
Indexable
Never
//Fibonacci Series using Recursion
#include<stdio.h>
int fib(int n)
{
   if (n <= 1)
      return n;

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

}

int main() {
   int n = 9;
   int i;

   printf("Fibbonacci of %d: " , n);

   for(i = 0;i<n;i++) {
      printf("%d ",fib(i));
   }
}