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 ▸Write a function that takes a string, and outputs that string formatted in camelcase. (alternating upper and lower case for each character, e.g. cAmElCaSe)
Write a simple number guessing game, give the user 3 tries to guess a number between 1 and 10
Whats is the difference between a function and a procedure?
How do you define a class in python