← 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
Topics:
Methods
Code Editor
1
Tab to indent · Ctrl+Enter to run · 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.