Implement Fibonacci and explain the time and space complexity.
Use the convention F(0) = 0 and F(1) = 1. Implement fibonacci(n), which accepts a nonnegative integer and returns the nth Fibonacci number.
F(0) = 0
F(1) = 1
fibonacci(n)
def fibonacci(n):
Your question is Fibonacci Implementation and Complexity. Start with the requirements in the Question tab.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
