MediumPython ProgrammingHigh School (9–10)High School (11–12)UndergraduateGeneralPython Essentials › RecursionNumericalPython-Coded
Write a recursive fibonacci(n). Show the first ten values. What is fibonacci(7)?
Contributed by StemPy LabTry it on paper first. A hint, the key idea and the worked solution are here when you need them.
Write a recursive fibonacci(n). Show the first ten values. What is fibonacci(7)?
Need a reminder? The key ideaShow
Each Fibonacci number is the sum of the two before it.
The worked solution
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, compare your working with the solution.
Base case. For n < 2, the answer is n itself: and .
Recursive case. The sum of the two before it: fibonacci(n - 1) + fibonacci(n - 2).
The first ten: . So fibonacci(7) is .
Discussion (0)
Log in to join the discussion.
Loading…