Fibonacci Recursion and Iteration

EasyPython

Problem

Write a function to implement the Fibonacci sequence both recursively and iteratively.

Implement one function that supports both approaches and returns the nth Fibonacci number. Use F(0) = 0 and F(1) = 1; the input is a non-negative integer and the output is an integer.

Constraints

0 <= n <= 30
The result fits within Python's integer representation
When recursive is true, use the recursive implementation
When recursive is false, use the iterative implementation

Function Signature

def fibonacci(n, recursive=False):

CodePython 3

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

Run your code to see test output here.