103k views
5 votes
Fibonacci numbers are a sequence of integers, starting with 1, where the value of each number is the sum of the two previous numbers,

e.g. 1, 1, 2, 3, 5, 8, etc. write a function called fibonacci that takes a parameter, n, which contains an integer value, and have it return the nth fibonacci number. (there are two ways to do this: one with recursion, and one without.)

User Joe Lyga
by
8.3k points

1 Answer

4 votes

Answer:

i think its will be A

Explanation:


User Pink Jazz
by
8.5k points

No related questions found

Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.4m questions

12.2m answers

Categories