#Factorial with Recursion
public int Factorial(int n) { if (n == 0) return 1; else return n * Factorial(n-1); }
#Factorial without Recursion
int factorial ( int input ) { int x, fact = 1; for ( x = input; x > 1; x--) fact *= x; return fact; }
#Factorial with Recursion
public int Factorial(int n) { if (n == 0) return 1; else return n * Factorial(n-1); }
#Factorial without Recursion
int factorial ( int input ) { int x, fact = 1; for ( x = input; x > 1; x--) fact *= x; return fact; }
0 Comments