sir in this current world of digital study ,we still wamt a teacher to explain the concept in detail like this..please continue the good work, we all appreciate your efforts .. thank you
Hello! Although I am learning C programming, at the explanation of recursive functions, the Fibonacci Sequence appeared. It seemed very difficult, because a statement has 2 functions, which is itself. I could not imaging how it expands, but I have understood it. Following your explanation, I also checked the process by my hand. Thank you, so much!
I don't know why you wouldn't get goods likes but your explanation is best I have seen many videos on this concept but understood by ur video so please make more videos even a complete course. Thanks alot sir.
This was the closest I came to understanding this. Then on the way back up the board got too cluttered and I couldn't follow. That's for getting me closer, sir.
Really very good I don't understand y there are less likes..... Because he is explaining tracing part very easily than compared to other vdeos which are complex to understand and also they ll get more likes yyyy it is so
Really u make me understood very well.... 👏👏👏👏..... Pls focus on communication lil bit u will get better success than others.... All d best n thanks u so much
you explain the part that most of student doesnt understand but i suggest you to redo the video and redo the plan clearly cause its hard sometimes to identify some numbers
Seriously man this recursion is not less than rocket science for a beginner like me...
Yeah😬
for fibonacii(5)
fibonacii(5) = fibonacci(3) + fibonacci(4)
= [ fibonacci(1) + fibonacii(2) ] + [ fibonacii(2) + fibonacci(3) ]
= [ 1 + 1 ] + [ 1 + [ fibonacii(1) + fibonacii(2) ] ]
= [ 1 + 1 ] + [ 1 + [ 1 + 1 ] ]
= 2 + [ 1 + 2 ]
= 2 + 3
= 5
i have tried simplifying it . Let me know if it helped you
@@anonymousnoob3660 I am thinking how much time you spend in writing this comment 🙂🙂🙂
@@kunalghosh4334 Don't bother as as long it helps i'm cool with it
@@anonymousnoob3660 ❤️
sir in this current world of digital study ,we still wamt a teacher to explain the concept in detail like this..please continue the good work, we all appreciate your efforts .. thank you
@jyotigupta6921 you are so sweet Jyoti Gugpta ji .. mera ek dost hai hai wo bhi gupta hai ...
@@kanhaiyabhardwaj4504simp spotted
I watched around 6 to 7 videos, only in this video I could understand the recursion properly. Thankyou
Awesome lecture life m pehli Baar koi Acha sai smjhaya hai
Finally i understand how last
fib(n-1)+fib(n-2) work.
Lots of thnak
Bestam Best explanation raja ji
Hello! Although I am learning C programming, at the explanation of recursive functions, the Fibonacci Sequence appeared. It seemed very difficult, because a statement has 2 functions, which is itself. I could not imaging how it expands, but I have understood it. Following your explanation, I also checked the process by my hand. Thank you, so much!
Is this Inc programming plu reply
well explained😊
I don't know why you wouldn't get goods likes but your explanation is best I have seen many videos on this concept but understood by ur video so please make more videos even a complete course.
Thanks alot sir.
ua-cam.com/play/PLz1fCnmAyf4uctgkU3_yYkXhkkLUQFkwt.html
Sir the video was great but only one thing has to be changed ,the fibonacci series starts from 0 ,i might be wrong but still this is what i know
Very very thanks sir literally i trying for last two days learning this concept of recursion today's i have finally understand this concept 🙏🏻
This was the closest I came to understanding this. Then on the way back up the board got too cluttered and I couldn't follow. That's for getting me closer, sir.
Thank you so much because of your explanation I clearly understood how recursive function works.
Best explanation sir 🔥🔥🔥
Thank you so much! This is helpful for doing code and past test cases in the assignments of Newton School. I'm so glad that I found it.
Thankyou, i finally understood because of your execution
Nice explanation technique understood very well. Thank you so much sir.
very helpful as a beginner.Thanku so much.
god 7:49 solved biggest mistery how fib 2 changed directy into 2 lol i paused 6:34 for 3-4 min to understand what he done
Best explaination thankyou lots of love from nepal keep growing ......
Really very good I don't understand y there are less likes..... Because he is explaining tracing part very easily than compared to other vdeos which are complex to understand and also they ll get more likes yyyy it is so
thank you sir itna acche se explaine karnne ke liye
Sir I satisfy your lecture but Fibonacci series start to 0
u can do it from 0, if u take 0 instead of 2 in base case..
Just put a printf("0, "); 😂
@@avesh_sayyed just replace the base if with this one: ‘if (n == 0 || n == 1) return n;’. That way you will print 0, 1, 1, 2…, n.
If you passed a 0 to this it would be an infinite loop...need if (n==0) return 0
we return n, if n==1 or if n==0
nicely explained sir 👍👍
Plss make a vid on fibonacci
I have spend over a 2 days to got this but after watching your video i got it in just 20 minutes thanks so much
Thanks finally understood after watching so many videos 😌
Really u make me understood very well.... 👏👏👏👏..... Pls focus on communication lil bit u will get better success than others.... All d best n thanks u so much
Thank you so much. Your explanation is truly understood.
Thank you so much Sir! Recursion gets confusing for me but this helps a lot!
Sir sir sir thank you very much
It is helpful for me
Thank You, the best explanation
Good job sir. Thank you
Explaination is good. But the board is too messy and you’ve squeeezed them together, u can hardly see anything
You are great teacher...
Very good explanation
Super explanation sir
love u from bangladesh....recursion clear....thank you sooo much... may ALLAH bless you.
Thank you dude, you helped me significantly
well this is only thing that made sense to me. seriously thankyou somuch.
video was helpfull. But sir make habbit to speak loud
awesome vid!! this helped so much!!
Very helpful.......
Loved the way how you explained
Good explanation i really appreciate
sir,though you had made a silly mistake,(:-p)only you managed me to understand this problem. thank you. :-)
Visit sci_comp channel on UA-cam to explore more on python
Thank you ☺️ sir❤️❤️
Must and should add for loop
Best info
Thank you so mich Brother 👍
Good
you explain the part that most of student doesnt understand but i suggest you to redo the video and redo the plan clearly cause its hard sometimes to identify some numbers
I got it, good explanation, tq☺
thanks for the video
This program generates only the nth term of Fibonacci series rather than displaying the Fibonacci series uptill nth term
If you can't speak English fluently then just try in your langauge
ek video bana dijya sir ... bada black board me bahut hotch pooch ho gha hai screen me
Sir video would have been nice if u had started from 0 not 1
Thank You, Sir
Why return 1 if condition, explain
TQ so much sir
First Fibonacci 0
👍🙂
But the first num may be 0 in the fibanocci series??
Doesn't Fibonacci series starts with 0?
Need full source code!
but the 1st fibonacci number is 0
Please what do you mean by n is it concerne the position of the number or what ??
thnku very much sir
Thank you sir
Thank you!!
thanku so muchh sir
Fibonacci series start from 0
0+1 also 1 so take the 1
@@manyammuppuri3927 ask to expert
@@prashantzambare1973 Its ok brother
not clear
this person messing up
You can start Fibonacci series with 0
yes
sir thanks for confusing with your delivering skill
nice
Bhai ache se padhana heii to padha warna mat padha
Onnum theriyama nadathadha
Sir Fibonacci series starts with 0
So u haven’t displayed it
What changes should be done to display 0
SIMPLY WRITE printf("0
");
not a good explanation, i cant understood anything at the last feb(3) call , whatching frequently but not understanding.
How bad it was... Poor explanation
ua-cam.com/play/PLz1fCnmAyf4uctgkU3_yYkXhkkLUQFkwt.html
Following wrong format
First learn and then explain