This question is based on the topic Recursion injava programming language
How would I make 3 test cases for the methodbelow
Fibonacci Sequence
// each item is the sum of the previous 2
// fibonacci(5) = fibonacci(4) +fibonacci(3)
// fibonacci(4) = fibonacci(3) +fibonacci(2)
// fibonacci(3) = fibonacci(2) +fibonacci(1)
// fibonacci(2) = fibonacci(1) +fibonacci(0)
if(n <= 1) {
return 1;
}
return fib(n-1) + fib(n-2);
Answer
public static int FibR( int n){ if(n == 0){ return 0; } if(n == 1){ return 1; }
OR
OR