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 ▸Whats the output of "for i in "hello world": print(i)" and why/how is this achieved
Write a program that takes a value x and then outputs x Fibonnaci numbers. E.g. if x=6 output would be 1 1 2 3 5 8
Write a program that computes the sum of all numbers up to a input number n
Write a recursive function to return the nth Fibonacci number in Python