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$ 3 4 5 6 GATE tbb-mockgate-1 algorithms recursion + – Bikram asked Jan 16, 2017 retagged Jan 9, 2020 by Arjun Bikram 316 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 5 votes 5 votes Make recursion tree for better understanding Bikram answered Jan 16, 2017 edited Jan 25, 2019 by Lakshman Bhaiya Bikram comment Share Follow See all 2 Comments See all 2 2 Comments reply ANKIT CHAUHAN 1 commented Feb 5, 2017 reply Follow Share sir how 6 ???? 1 votes 1 votes RohitKumarSingh commented Dec 19, 2018 reply Follow Share My answer is 6. But it is still showing correct answer as 3. Please rectify the mistake in paper. 0 votes 0 votes Please log in or register to add a comment.