遞歸:
long Factorial(long n)
{
if(n == 1)
return 1;
else
return n * Factorial(n-1);
}
非遞歸:
{ int i;
long result = 1;
return n;
for(i = 1; i <= n; i++)
result = result*i;
return result;