Fibonacci Series Using Recursion in C

Program 1

// Fibbonacci Series using recursion
// 0      1     1     2    3   5    8      13    24   ..... n 
#include<stdio.h>
#include<conio.h>
void fibbonacci(int);
int main()
{
      system("cls");
      int n;
      printf("Enter a number");
      scanf("%d",&n);
      fibbonacci(n);
      return 0;
}
void fibbonacci(int n)  // n=0
{
      static int a=-1,b=1,c;  // a=5 ,b=8  ,c 
      if(n==0)   
        return;
      else
      {
          c=a+b;   // c=13
          printf("%6d",c);     // 0   1    1    2    3      5       8    13 
          a=b; 
          b=c;
          fibbonacci(n-1);
      }  
}