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?
What is the range of denary numbers that can be represented using 8-bit two’s complement binary integers?
Simplify the boolean expression ¬(A.B)+A.
Describe an advantage of using vector graphics instead of bitmaps to represent images.