Fibonacci series using Recursion

#include<stdio.h>
#include<conio.h>
int fibonacci(int);
main()
{
int n, i = 0, j;
printf(" Enter the number of terms");
scanf("%d",&n);
printf("First 10 terms of fibonacci series are :\n");
for ( j = 1 ; j <= n ; j++ )
{
printf("%d\n", fibonacci(i));
i++; 
}
return 0;
}
int fibonacci(int n)
{if ( n == 0 )
return 0;
else if ( n == 1 )
return 1;
else
return ( Fibonacci(n-1) + Fibonacci(n-2) );
}

Output Of Program