Fibonacci Implementation

EasyPython

Write a function to find the nth term in the Fibonacci sequence.

Use zero-based indexing: F(0) = 0 and F(1) = 1. Given a non-negative integer n, return the integer value of F(n).

The function must use an iterative approach with constant auxiliary space.

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.