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 ▸Why are bit patterns often displayed in hexadecimal notation instead of binary notation?
Explain why it is important to check the email address with JavaScript and again when it reaches the server.
Explain a bubble sort. You may use pseudocode and/or diagrams to help demonstrate your answer.
Which are the parts of a compuer?