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 ▸What can be used to iterate through a list in python?
Explain how you would write a python program that takes a rectangle and a point in a 2D space as command-line arguments and checks if they intersect.
Write a function that checks whether a number is prime or not.
Create a python code to sum the number from 1 to 10.