Recursive Fibonacci Implementation

EasyPython

Problem

Write a recursive function to solve the Fibonacci sequence. Implement fibonacci(n) using F(0) = 0 and F(1) = 1, and return the nth Fibonacci number for a nonnegative integer n. The function accepts one integer and returns one integer, for example fibonacci(5) returns 5 and fibonacci(0) returns 0.

Constraints

0 <= n <= 30
F(0) = 0 and F(1) = 1
Return the Fibonacci value at zero-based index n

Function Signature

def fibonacci(n):

CodePython 3

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

Run your code to see test output here.