Implement a fibonacci function which calculates the nth number of the fibonacci sequence.
def fib(n): if n <= 1: return n else: return(fib(n-1) + fib(n-2))
This is the code for a very basic version. This coud be used to explain how recursion works thanks to a relatively easy example.
AF
Related Python Mentoring answers
All answers ▸With the help of Pandas and Numpy library create a DataFrame with the columns "Name", "Surname", "Age" and "Gender", create as many rows as you want. Print out the result.
When do we use a for-loop and when a while-loop?
What is the difference between a for loop and a while loop.
Create a program that checks for syntactical errors in an email address.