Fibonacci series using Recursion

Fibonacci series using Recursion

#include<stdio.h>
#include<conio.h>
main()
{
    int n,i;
    clrscr();
    printf("\n How many terms do you want to print:");
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
    printf("\n %d",fib(i));
    }
    getch();
    }

    fib(int m)
    {
       if(m==0)
          return 0;
       if(m==1)
          return 1;
       return (fib(m-1)+ fib(m-2));
    }