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
Answered by Meer S. Computing tutor

1689 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

What is the range of denary numbers that can be represented using 8-bit two’s complement binary integers?


Write a Pseudocode function that returns the factorial of an integer input.


Define resolution in regards to images and how it differs from colour depth


What is 'Virtual Memory', and how does it work?


We're here to help

contact us iconContact ustelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

MyTutor is part of the IXL family of brands:

© 2025 by IXL Learning