# Funny Febo !

Assume a recursive function to find the $$n^\text{th}$$ Fibonacci term. What is the number of calls for that function to find the $$7^\text{th}$$ term?

Details and Assumptions:

• $$f(0)=1$$, $$f(1)=1$$ and $$f(7)=21$$
• $$f(z)=f(z-1)+f(z-2)$$ where $$z\ge2$$

##### This problem is a part of the set: Efficient Algorithms.
×

Problem Loading...

Note Loading...

Set Loading...