retagged by
316 views
0 votes
0 votes

How many times $fibon$$\left ( 3 \right )$ is called during invocation of $fibon$ $\left ( 6 \right )$?

$fibon(x) = fibon(x-1) + fibon(x-2)$
$fibon(0) = 1$
$fibon(1) = 1$

  1. 3
  2. 4
  3. 5
  4. 6
retagged by

1 Answer

Best answer
5 votes
5 votes

Make recursion tree for better understanding

edited by
Answer:

Related questions

4 votes
4 votes
2 answers
3
Bikram asked Jan 16, 2017
860 views
Hash a list of $3$ keys into hash table with $20$ locations. What will be the probability of the event $A$ in which hashing the three keys causes a collision?$0.123$$0.14...