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 CISC computer with an an internal clock of 800 MHz, executes about ______ instructions per section.
Fill in the blank(s) with the appropriate word(s).
What does the following commands do?
What will be an ideal response?
Recursively visiting the root node, left subtree and then the right subtree describes:
(a) preorder processing (b) inorder processing (c) postorder processing (d) none of the above
Web site visitors characteristically like scrolling Web pages either vertically or horizontally.
Answer the following statement true (T) or false (F)