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 the above, there is no infinite recursion in this method

Question

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 the above, there is no infinite recursion in this method

Quizplus · Accepted Answer

C) The recursive case has the method calling itself with the same parameter, and so n does not change, thus if (n > 0) is initially True, it will remain True.

Why Is the Following Method One Which Has Infinite Recursion