Coursera Data Structures and Algorithms Specialization: Algorithm Warm-up(Week 2)

Courtesy of Unsplash

1. What can we learn from the Fibonacci Numbers problem?

The native implementation in Python is as follows:

def native_fib(n: int) -> int:
    if n<=1:
        return n
    else:
        return native_fib(n-1)+native_fib(n-2)