how to calculate the number of recursive calls for nth fibonacci number?please explain in detail also derive the formula for that.please do not give a link ofd some other website.
Recursive calls issue
For calculating the number of recursive call, you can draw the recursion tree for some small number and from that you can deduce that it will 2^n.
And regarding the proof of fibonacci numbers as you have said that you don’t want to see any link and it will be the same thing if i will do, so i just suggest you through some good mathematical derivation by googling you can do that.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.