Question: Question 20 Consider the following function: public static int mystery(int n) { return (n-1)* mystery(n-2); } a) Explain why this program has infinite recursion. b)
Question 20
Consider the following function:
public static int mystery(int n) {
return (n-1)* mystery(n-2);
}
a) Explain why this program has infinite recursion.
b) What information would you need to implement this function correctly?
Question 21
Consider the following function:
public static void int mystery3(int n){ if (n = 0) return 0; else return n + mystery3(n-1) }
What is the output mystery3(5)?
Question 21 options:
| 0 | |
| 5 | |
| 10 | |
| 15 |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
