Question

The following recursive method factRecursive computes the factorial of positive integer n. Demonstrate that this method is recursive.

public static int factRecursive(int n)
{
    int result = 0;
    if (n == 0)
    {
        result = 1;
    }
    else
    {
        result = n * factRecursive(n - 1);
    }

    return result;
}

Answer 1

a method is called a recursive method, if it contains a method call to itself.
here in factRecursive method, there is a method call of factRecursive(n - 1). so, this method is calling itself inorder to solve a problem.
so, this method is recursive.