Fill in the code to complete the following function for computing factorial.
```
/** Return the factorial for a specified index */
long factorial(int n)
{
if (n == 0) // Base case
return 1;
else
return _____________; // Recursive call
}
```
A. factorial(n - 1) * n
B. n
C. n * factorial(n - 1)
D. n * (n - 1)
A. factorial(n - 1) * n
C. n * factorial(n - 1)
You might also like to view...
A technician is not able to ping a server by the FQDN but can by the IP. Which of the following should the technician check?
A. Ensure that WINS is configured B. Ensure that the DNS is configured C. Ensure the MAC address is correct D. Ensure that the IP address is correct
In CSS, selector names that begin with a period are called __________ selectors.
a. class b. node c. type d. object