@@GATEAppliedCourse in the last, it should be 2^(n-2) *c Because when in the leftmost node, n-1 c n-2 2^(2-1) *c n-3 2^(3-1) *c .... .... n-(n-1) 2^(n-1-1) or we can say that 1 2^(n-2)
@@AbhishekGupta-vs4du @GATE Applied Course in the last, it should be 2^(n-2) *c Because when in the leftmost node, n-1 c n-2 2^(2-1) *c n-3 2^(3-1) *c .... .... n-(n-1) 2^(n-1-1) or we can say that 1 2^(n-2)
Finally an explanation I understand, loved the visual representation by drawing the tree. Super clear.
Glad it was helpful!
@@GATEAppliedCourse in the last, it should be 2^(n-2) *c
Because when in the leftmost node,
n-1 c
n-2 2^(2-1) *c
n-3 2^(3-1) *c
.... ....
n-(n-1) 2^(n-1-1) or we can say that
1 2^(n-2)
Very good video. Fibonacci would be proud.
Fabonacci : F(1) = 1 and F(2) = 2 and F(n) = F(n-1) + F(n-2) n takes value {1....n}
Awesome video, thanks!
Good explanation. Thanks a lot.
Nice description! So helpful! Great work!!!!
AMAZING VIDEOS
Do you have asymptotic analysis for Iterative function
very nice explanation!
thank you..was searching this for so longg
No problem 😊
Thank you for the great explanation sir
Love it! I always need that visual component, like the tree, to understand things. Thanks!
Can someone explain how 2n-1 came?? Plz
Is it non recurrsive algorithm
No it’s recursive algorithm
Amazingggggggggggggggggggggggggggggggggggggggggggg
Supppppppeerrrrrrrbbbbbbbb....:D
Instead of this if you took any value and explained, it will be more understandable for us..
Why 2^n-1
refer geometric series
@@AbhishekGupta-vs4du @GATE Applied Course in the last, it should be 2^(n-2) *c
Because when in the leftmost node,
n-1 c
n-2 2^(2-1) *c
n-3 2^(3-1) *c
.... ....
n-(n-1) 2^(n-1-1) or we can say that
1 2^(n-2)
explanation is 10/10 minus the accent xD