sir,in this video sir told us about about how the fuction work in memory,so when n =1 it goes to base case and return n that is 1 and f1 becomes 1 and after that f2is called and then n=0,please tell me n becomes 0
Fibonacci recursion stack representation
hello @Abhishmu5
when n will become 0 then 0 will be return ( in the same way as when n =1 )
so what exaclty u want to ask?
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.