Multiple Choice
Why is the following method one which has infinite recursion? public int infiniteRecursion(int n)
{
If (n > 0) return infiniteRecursion(n) + 1;
Else return 0;
}
A) because there is no base case
B) because the base case will never be true
C) because the recursive call does not move the parameter closer to the base case
D) because the recursive call moves the problem further away from the base case
E) None of these; this method isn't infinitely recursive
Correct Answer:

Verified
Correct Answer:
Verified
Q3: A recursive algorithm is superior to an
Q4: Example Code Ch 12-1<br>Given the following recursive
Q5: If one were to create a Towers
Q6: Define the magnitude of a number as
Q7: Describe how to solve the Towers of
Q9: What is a fractal?<br>A) a portion of
Q10: Example Code Ch 12-3<br>Given the two recursive
Q11: The following method should return true if
Q12: Which of the following methods would properly
Q13: The difference between direct and indirect recursion