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 ▸Represent the denary number 5.625 as an unsigned binary fixed point number with three bits before and five bits after the binary point.
Describe a stack data structure.
What is the difference between a high level language and a low level language?
Describe the difference between TCP and UDP.