Factorial Recursion and Iteration

public static int factorialIteration(int n) { int temp = 1; if(n == 0) { return 1; } else { for(int i = 1; i <= n; i++) { temp = temp * i; } } return temp; } public static int factorialRecursion(int n) { if (n == 0) { return 1; } else { return n * factorialRecursion(n - 1); } }