Recursion

AP Computer Science A· difficulty 3/5

public static int bad(int n) {
    if (n == 0) return 0;
    return n + bad(n + 1);
}
bad(1);

What happens?

A
$StackOverflowError$
check_circle
B
$Returns 0$
C
$Returns 1$
D
$Compile-time error$

Explanation

The recursive call goes AWAY from the base case (n+1 instead of n-1), causing infinite recursion and stack overflow.

Want 10 more like this — adaptive to your weak spots?

Practice 10 like thisarrow_forward Predict my AP score

Related questions

csa-rec-028
<codepower(a, b)</code with O(log b) (using even/odd halving) is achieved by…
chevron_right
csa-mix-112
What does this print for n=3? <codevoid p(int n) { if (n == 0) return; p(n - 1); System.out.print(n); p(n - 1); } </code</pre…
chevron_right
csa-u910-041
What is printed?…
chevron_right

auto_awesomeAll Tools question_answerHomework Q&A menu_bookAP & SAT Prep timelineLearn Mode