AP Computer Science A· difficulty 3/5
public static int f(int n) {
if (n == 0) return 1;
return n * f(n + 1);
}What is wrong?
Base case should return 0
Nothing is wrong
Multiplication should be addition
The recursive call increases n; it never reaches the base case for n > 0
Explanation
f(n+1) makes n grow without bound, so the base case n == 0 is never reached for positive starting values, leading to a stack overflow.
Want 10 more like this — adaptive to your weak spots?
<codeint f(int n) { if (n <= 0) return 0; return n + f(n - 2); } </code</pre f(5) returns…
chevron_rightgcd(12, 18) by Euclid: gcd(12,18) = gcd(18,12%18) = gcd(18,12) = gcd(12,18%12) = gcd(12,6) = gcd(6,12%6) = gcd(6,0) = ?…
chevron_rightConsider: <code class="language-java"public static String r(String s) { if (s.length() <= 1) return s; return r(s.substring(1)) + s.charAt(0); } </code</pre Wha…
chevron_right