Fill in the code to complete the following method for computing factorial.
```
/** Return the factorial for a specified index */
public static long factorial(int n) {
if (n == 0) // Base case
return 1;
else
return _____________; // Recursive call
}
```
a. n * (n - 1)
b. n
c. n * factorial(n - 1)
d. factorial(n - 1) * n
c. n * factorial(n - 1)
d. factorial(n - 1) * n
Computer Science & Information Technology
You might also like to view...
Metrics like the attack vector, complexity, exploit maturity, and how much user interaction is required are all found in what scoring system?
A. CVE B. CVSS C. CNA D. NVD
Computer Science & Information Technology
Which of the following is a Kerberos service that initially exchanges information with the client and server by using secret keys?
A. authentication server B. authentication client C. key distribution center D. ticket granting service
Computer Science & Information Technology