recursion
factorial
int factori(int n)
{
if(n<=1) return 1;
return n * factori(n-1);
}
int main()
{
printf("%d",factori(3));
}
Fibonacci sequence
int factori(int n)
{
if(n==1) return 1;
if(n==0) return 0;
return factori(n-2) + factori(n-1);
}
int main()
{
int i;
scanf("%d",&i);
printf("%d",factori(i));
}