← Back to Methods
Question 153
Recursive Fibonacci
Recursive Fibonacci
Complete the static method Fib so it returns the nth Fibonacci number using RECURSION, where Fib(0) = 0, Fib(1) = 1, and each later value is the sum of the previous two. Do NOT write a Main method.
For Fib(10) the program prints 55.Expected Output:
55= newline. The output ends with a newline — print one after the last line.
Hints2 available
Sign in to use hintsTopics:
Methods
1
Tab to indent (Esc then Tab to move on) · Ctrl+Enter to run · Shift+Alt+F to format · Ctrl+Space to expand shortcuts (cw, cr, fori)
Your Output
Run your code to see the output here...
Test Cases
Run your code to see test case results.