how the fibo (3) is called there is fibo(4) then when main function called fibo(4 ) is called after that it enters into the fibo block then again the base case called that’s why fibo(3) is called ? am I right?
Fibo recursion call stack
Try to build the recursion tree to understand.
Refer this:
I don’t understand please explain clearly
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.