Q: Calculate factorial by using recursion.
A:
int fuct (int n)
{
n=(n<0)? -n: n;
if (n>1)
return n * fuct (n-1);
else
return 1;
}