F(n)=f(n-1)+f(n-2);

#1

i have problem in understanding this recursion tree of fibonacci how it works in call stack please tell in easy way
I was also not able to to get into tilling problem solution theory

#2

First try to understand the concept of recursion thoroughly before moving on to its problems.
Watch the videos in your course carefully and try to understand each and every question explained.


Check out this link. You can also watch some videos on youtube for further infoormation.

#3

Bhaiya I understood the concept the link thread which you gave I have read that earlier also. But I want to know how is this f(n)=f(n-1)+f(n-2) how it works on call stack please

I know how the the call stack is made for f(n)=f(n-1);

#4

There are two recursion calls in the same line. So it is better to understand this by making use of a recursion tree.

#5

Watch this video
#6

how to mark this doubt as resolved there is no option available which says mark as resolved i am not getting the doubt portal section my asked doubts are not being shown. how to mark this as resolved

#7

i have asked doubts earlier also but this doubt which i have asked is not showing it as asked dobut. I want to mark it as resolved

#8

Well it must be appearing somewhere in the “Ask Doubts” section of your course.