Demonstrate how factorial(4) is computed given the following recursive method for factorial:
public int factorial(int n)
{
if (n 1) return factorial(n - 1) * n;
else return 1;
}

Question

Demonstrate how factorial(4) is computed given the following recursive method for factorial:
public int factorial(int n)
{
if (n > 1) return factorial(n - 1) * n;
else return 1;
}

Quizplus · Accepted Answer

The Answer of Demonstrate how factorial(4) is computed given the following recursive method for factorial:
public int factorial(int n)
{
if (n > 1) return factorial(n - 1) * n;
else return 1;
}

Demonstrate How Factorial(4) Is Computed Given the Following Recursive Method