In Python, write a recursive function that returns the first n Fibonacci numbers.
Begin by denoting the first and second Fibonacci number as 0 and 1 respectively. This helps us define a base case for our algorithm. We know that new Fibonacci numbers are formed by adding its 2 predecessors. This will help us define the recursive call.
Code:def Fibonacci(n): if n == 0: return 0 elif n == 1: return 1 else: return Fibonacci(n-1)+Fibonacci(n-2)
MS
Related Computing A Level answers
All answers ▸Image a graph. In which instances is it more appropriate to use an adjacency list instead of an adjacency matrix?
What is an OOP (Object Oriented Programming) language?
What are the main differences between different loops when it comes to coding ?
Explain what is meant by the term ‘TCP/IP stack’ [3]