29 lines
771 B
Java
29 lines
771 B
Java
|
|
public class FactorialVariations {
|
||
|
|
public static int factorialRecursive(int n) {
|
||
|
|
if (n <= 1) {
|
||
|
|
return 1;
|
||
|
|
}
|
||
|
|
return n * factorialRecursive(n - 1);
|
||
|
|
}
|
||
|
|
|
||
|
|
public static int factorialIterative(int n) {
|
||
|
|
int result = 1;
|
||
|
|
int i = 1;
|
||
|
|
while (i <= n) {
|
||
|
|
result = result * i;
|
||
|
|
i = i + 1;
|
||
|
|
}
|
||
|
|
return result;
|
||
|
|
}
|
||
|
|
|
||
|
|
public static int main() {
|
||
|
|
System.out.println(factorialRecursive(5));
|
||
|
|
System.out.println(factorialIterative(5));
|
||
|
|
System.out.println(factorialRecursive(7));
|
||
|
|
System.out.println(factorialIterative(7));
|
||
|
|
System.out.println(factorialRecursive(10));
|
||
|
|
System.out.println(factorialIterative(10));
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
}
|