What does <code>mystery(4)</code> return given:
<code>int mystery(int n) { if (n <= 1) return n; return mystery(n-1) + mystery(n-2); } </code></pre>
- A
4
- B
5
- C
6
- Dcheck_circle
3
Explanation
Fibonacci: F(0)=0, F(1)=1, F(2)=1, F(3)=2, F(4)=3.
Recursion
AP Computer Science A· difficulty 4/5
Want 10 more like this — adaptive to your weak spots?