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

1559 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

Show how the decimal number -183 would be represented as an 8-bit two's complement arithmetic


What is method "Overloading" in object-oriented programming (OOP) ?


What is the difference between RAM & ROM and the ways they are used within a computer system?


Why would you use Assembly Language instead of a normal programming language?


We're here to help

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

© MyTutorWeb Ltd 2013–2025

Terms & Conditions|Privacy Policy
Cookie Preferences