The factorial of an integer is the product of that integer multiplied by all the positive non-zero integers less than that integer. So, 5! ! is the mathematical symbol for factorial) is 5 * 4 * 3*2*1. 4! is 4*3*2*1, so 5! could be written as 5*4!. So a recursive definition of factorial is n! is n*n-1)!, as long as n 1. 1! is 1. What is the recursive call for this function fact)?
A) factn)*n;
B) factn-1)*n;
C) n-1)*factn)
D) factn-2)*n-1)

Question

The factorial of an integer is the product of that integer multiplied by all the positive non-zero integers less than that integer. So, 5! ! is the mathematical symbol for factorial) is 5 * 4 * 3*2*1. 4! is 4*3*2*1, so 5! could be written as 5*4!. So a recursive definition of factorial is n! is n*n-1)!, as long as n >1. 1! is 1. What is the recursive call for this function fact)?
A) factn)*n;
B) factn-1)*n;
C) n-1)*factn)
D) factn-2)*n-1)

Quizplus · Accepted Answer

The recursive call for fact function would be fact(n-1)*n, which means we need to call the fact function with the parameter n-1 and then multiply the result with n to get the factorial of n. For example, to find the factorial of 5, we would call fact(4), which would call fact(3), and so on until we reach fact(1), which returns 1. Then we multiply all the results together: fact(5) = fact(4) * 5 = fact(3) * 4 * 5 = fact(2) * 3 * 4 * 5 = fact(1) * 2 * 3 * 4 * 5 = 1 * 2 * 3 * 4 * 5 = 120.

The Factorial of an Integer Is the Product of That