Recursion using Fibonacci Series

This program demonstrates recursion using Fibonnacci Series program.

Language : C

[sourcecode language='c']
//Recursive Function
#include
long fact (int n);

void main()
{ int n; long f;
printf(“Enter a number : ” );
scanf(“%d”, &n);
f=fact(n);

printf(“%d”, f);
}

long fact (int n)
{ long f;

if(n==0)
return 1;

f=n*fact(n-1);
return f;
}
[/sourcecode]

Tagged as: Algorithms, Programming, Recursion