Recursive Fibonacci Implementation

EasyPython

Problem

How would you write a recursive function to get the nth number in the Fibonacci sequence?

Use zero-based indexing: F(0) = 0 and F(1) = 1. Implement fib(n), which accepts a non-negative integer and returns the nth Fibonacci number. Explain the base cases and the time and space complexity of the direct recursive approach.

Constraints

0 <= n <= 30
Use zero-based indexing
Return an integer

Function Signature

def fib(n):

CodePython 3

You need to log in / sign up to run or submit.Ln 2

Run your code to see test output here.