Recursive Fibonacci Method
Consider the following program. What value is printed when it is executed?
public class Fibonacci {
public static int fib(int n) {
if(n <= 1)
return n;
return fib(n - 1) + fib(n - 2);
}
public static void main(String[] args) {
System.out.println(fib(4));
}
}
A
3
B
5
C
2
D
8
Question Leaderboard
| Rank | |||||
|---|---|---|---|---|---|
| #1 | richa.tuli | 2 | 2 | 2m 02s | 78 |
| #2 | singhris000 | 1 | 1 | 0m 29s | 71 |
| #3 | ethan | 1 | 3 | 0m 41s | 39 |
| #4 | lightingstrikes1342 | 0 | 1 | 0m 00s | -10 |
| #5 | suhanakochhar006 | 0 | 1 | 1m 35s | -105 |
APFIVE