recursion fibonacci series

  Рет қаралды 211,368

Satpute Academy

Satpute Academy

Күн бұрын

Пікірлер: 113
@PROTECHRAHUL
@PROTECHRAHUL 3 жыл бұрын
Seriously man this recursion is not less than rocket science for a beginner like me...
@maha-kq9um
@maha-kq9um 3 жыл бұрын
Yeah😬
@anonymousnoob3660
@anonymousnoob3660 3 жыл бұрын
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
@kunalghosh4334
@kunalghosh4334 3 жыл бұрын
@@anonymousnoob3660 I am thinking how much time you spend in writing this comment 🙂🙂🙂
@anonymousnoob3660
@anonymousnoob3660 3 жыл бұрын
@@kunalghosh4334 Don't bother as as long it helps i'm cool with it
@pratikghule2995
@pratikghule2995 2 жыл бұрын
@@anonymousnoob3660 ❤️
@jyotigupta6921
@jyotigupta6921 4 жыл бұрын
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
@kanhaiyabhardwaj4504
@kanhaiyabhardwaj4504 Жыл бұрын
@jyotigupta6921 you are so sweet Jyoti Gugpta ji .. mera ek dost hai hai wo bhi gupta hai ...
@nikhil17141
@nikhil17141 Жыл бұрын
​@@kanhaiyabhardwaj4504simp spotted
@neetujha4168
@neetujha4168 4 жыл бұрын
I watched around 6 to 7 videos, only in this video I could understand the recursion properly. Thankyou
@akashsahu54
@akashsahu54 6 ай бұрын
Bestam Best explanation raja ji
@Xmarty_Live
@Xmarty_Live 4 жыл бұрын
Awesome lecture life m pehli Baar koi Acha sai smjhaya hai
@sbikki1248
@sbikki1248 5 жыл бұрын
Finally i understand how last fib(n-1)+fib(n-2) work. Lots of thnak
@kshitizkaushik8092
@kshitizkaushik8092 2 жыл бұрын
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
@陈瀚龙
@陈瀚龙 4 жыл бұрын
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.
@001Tadasuke
@001Tadasuke 4 жыл бұрын
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!
@dragonballs8643
@dragonballs8643 2 жыл бұрын
Is this Inc programming plu reply
@BestTutes
@BestTutes 6 жыл бұрын
Sir I satisfy your lecture but Fibonacci series start to 0
@areebamughal750
@areebamughal750 6 жыл бұрын
u can do it from 0, if u take 0 instead of 2 in base case..
@avesh_sayyed
@avesh_sayyed 4 жыл бұрын
Just put a printf("0, "); 😂
@beepst
@beepst 2 жыл бұрын
@@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.
@himanshusharma1066
@himanshusharma1066 5 жыл бұрын
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.
@ProgrammingZone
@ProgrammingZone 4 жыл бұрын
kzbin.info/aero/PLz1fCnmAyf4uctgkU3_yYkXhkkLUQFkwt
@vaibhavbilwal5903
@vaibhavbilwal5903 2 жыл бұрын
Very very thanks sir literally i trying for last two days learning this concept of recursion today's i have finally understand this concept 🙏🏻
@Ritik7_77
@Ritik7_77 Жыл бұрын
well explained😊
@WeGaming-26
@WeGaming-26 Жыл бұрын
Best explanation sir 🔥🔥🔥
@saurabhraj2690
@saurabhraj2690 Жыл бұрын
Thankyou, i finally understood because of your execution
@Prajwal_9
@Prajwal_9 3 жыл бұрын
Best explaination thankyou lots of love from nepal keep growing ......
@nobody12-x1k
@nobody12-x1k Жыл бұрын
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
@n.s.karthik5628
@n.s.karthik5628 5 жыл бұрын
Thank you so much because of your explanation I clearly understood how recursive function works.
@kanhaiyabhardwaj4504
@kanhaiyabhardwaj4504 Жыл бұрын
ek video bana dijya sir ... bada black board me bahut hotch pooch ho gha hai screen me
@rushikeshpanchal1349
@rushikeshpanchal1349 3 жыл бұрын
Nice explanation technique understood very well. Thank you so much sir.
@SuprabhaDeyTalentsToSee
@SuprabhaDeyTalentsToSee 3 жыл бұрын
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.
@athirasekhar2033
@athirasekhar2033 2 жыл бұрын
very helpful as a beginner.Thanku so much.
@kirandhope5989
@kirandhope5989 6 жыл бұрын
This program generates only the nth term of Fibonacci series rather than displaying the Fibonacci series uptill nth term
@brandogg
@brandogg 5 жыл бұрын
If you passed a 0 to this it would be an infinite loop...need if (n==0) return 0
@GurpreetSingh-ps6kl
@GurpreetSingh-ps6kl 3 жыл бұрын
we return n, if n==1 or if n==0
@sruthigopi7224
@sruthigopi7224 4 жыл бұрын
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
@mitrajsinh7081
@mitrajsinh7081 Жыл бұрын
Thanks finally understood after watching so many videos 😌
@iqqss_6325
@iqqss_6325 5 жыл бұрын
Explaination is good. But the board is too messy and you’ve squeeezed them together, u can hardly see anything
@alphonsegerold2830
@alphonsegerold2830 7 ай бұрын
Good job sir. Thank you
@harshasuresh4062
@harshasuresh4062 2 жыл бұрын
Thank you so much Sir! Recursion gets confusing for me but this helps a lot!
@SmartProgramming
@SmartProgramming 6 жыл бұрын
nicely explained sir 👍👍
@aramaicjew3212
@aramaicjew3212 3 жыл бұрын
Plss make a vid on fibonacci
@mdfarhan0203
@mdfarhan0203 Жыл бұрын
thank you sir itna acche se explaine karnne ke liye
@hamzachaoui5940
@hamzachaoui5940 5 жыл бұрын
Please what do you mean by n is it concerne the position of the number or what ??
@santoshr4212
@santoshr4212 3 жыл бұрын
Why return 1 if condition, explain
@syedhaiderali1519
@syedhaiderali1519 5 жыл бұрын
video was helpfull. But sir make habbit to speak loud
@naveenkumarkn2731
@naveenkumarkn2731 5 жыл бұрын
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
@informationtechnology7114
@informationtechnology7114 2 жыл бұрын
You are great teacher...
@maksperminov
@maksperminov Жыл бұрын
Thank You, the best explanation
@tinkalrokade7420
@tinkalrokade7420 2 жыл бұрын
Sir sir sir thank you very much It is helpful for me
@alexEMP1
@alexEMP1 Жыл бұрын
Very good explanation
@venkatacharan3359
@venkatacharan3359 2 жыл бұрын
But the first num may be 0 in the fibanocci series??
@chetansonawane9286
@chetansonawane9286 2 жыл бұрын
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
@harshalgore4117
@harshalgore4117 6 жыл бұрын
Sir Fibonacci series starts with 0 So u haven’t displayed it What changes should be done to display 0
@kunal4557
@kunal4557 6 жыл бұрын
SIMPLY WRITE printf("0 ");
@RATANAGARWALITINFORMER
@RATANAGARWALITINFORMER 3 жыл бұрын
Good
@ritavyas644
@ritavyas644 4 жыл бұрын
Thank you so much. Your explanation is truly understood.
@munawarmahtab2978
@munawarmahtab2978 6 жыл бұрын
sir,though you had made a silly mistake,(:-p)only you managed me to understand this problem. thank you. :-)
@shilpi0812
@shilpi0812 4 жыл бұрын
Visit sci_comp channel on KZbin to explore more on python
@payalsingh2296
@payalsingh2296 16 күн бұрын
Doesn't Fibonacci series starts with 0?
@medrmn294
@medrmn294 5 жыл бұрын
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
@mohammadsaidi880
@mohammadsaidi880 6 жыл бұрын
love u from bangladesh....recursion clear....thank you sooo much... may ALLAH bless you.
@narayananka6081
@narayananka6081 5 жыл бұрын
Super explanation sir
@proxy8918
@proxy8918 3 жыл бұрын
Thank you dude, you helped me significantly
@mehmetcanevi2997
@mehmetcanevi2997 3 жыл бұрын
Thank you so mich Brother 👍
@chirag8503
@chirag8503 4 жыл бұрын
Sir video would have been nice if u had started from 0 not 1
@cme-033manojrao7
@cme-033manojrao7 2 жыл бұрын
Must and should add for loop
@poppymoonpaperie5458
@poppymoonpaperie5458 2 жыл бұрын
awesome vid!! this helped so much!!
@gratusrichard1644
@gratusrichard1644 3 жыл бұрын
well this is only thing that made sense to me. seriously thankyou somuch.
@gatplace2738
@gatplace2738 Жыл бұрын
Best info
@nipu41
@nipu41 6 жыл бұрын
Loved the way how you explained
@rnjnmhta.catomato
@rnjnmhta.catomato 2 жыл бұрын
thanks for the video
@aniketdhara2435
@aniketdhara2435 3 жыл бұрын
Thank you ☺️ sir❤️❤️
@techenick3854
@techenick3854 Жыл бұрын
If you can't speak English fluently then just try in your langauge
@danishdev358
@danishdev358 4 жыл бұрын
Good explanation i really appreciate
@suhasgt7799
@suhasgt7799 2 жыл бұрын
Need full source code!
@hipravwaghela1266
@hipravwaghela1266 2 жыл бұрын
Very helpful.......
@rajkirankhulimuli5182
@rajkirankhulimuli5182 5 ай бұрын
Thank You, Sir
@nikhilgaonkar1320
@nikhilgaonkar1320 Жыл бұрын
but the 1st fibonacci number is 0
@mohammedfahad2746
@mohammedfahad2746 5 жыл бұрын
I got it, good explanation, tq☺
@parashurampm2064
@parashurampm2064 2 жыл бұрын
TQ so much sir
@harini7481
@harini7481 5 жыл бұрын
You can start Fibonacci series with 0
@anonymousnoob3660
@anonymousnoob3660 3 жыл бұрын
yes
@prashantzambare1973
@prashantzambare1973 6 жыл бұрын
Fibonacci series start from 0
@manyammuppuri3927
@manyammuppuri3927 6 жыл бұрын
0+1 also 1 so take the 1
@prashantzambare1973
@prashantzambare1973 6 жыл бұрын
@@manyammuppuri3927 ask to expert
@anujgupta7749
@anujgupta7749 4 жыл бұрын
@@prashantzambare1973 Its ok brother
@leninlenin9037
@leninlenin9037 5 жыл бұрын
First Fibonacci 0
@anilbarad1856
@anilbarad1856 2 жыл бұрын
not a good explanation, i cant understood anything at the last feb(3) call , whatching frequently but not understanding.
@__Kuch_Bhi___
@__Kuch_Bhi___ Жыл бұрын
👍🙂
@nikhil7129
@nikhil7129 2 жыл бұрын
sir thanks for confusing with your delivering skill
@gsharma8781
@gsharma8781 5 жыл бұрын
thnku very much sir
@ramanand6836
@ramanand6836 4 жыл бұрын
Thank you sir
@soniyaperera6337
@soniyaperera6337 3 жыл бұрын
not clear
@salmanmehmood180
@salmanmehmood180 3 жыл бұрын
this person messing up
@ldsahoo9234
@ldsahoo9234 Жыл бұрын
Bhai ache se padhana heii to padha warna mat padha
@eliaswurzer6200
@eliaswurzer6200 4 жыл бұрын
Thank you!!
@hilaryknight2916
@hilaryknight2916 5 жыл бұрын
thanku so muchh sir
@leninlenin9037
@leninlenin9037 5 жыл бұрын
Onnum theriyama nadathadha
@MohsinJunaidEE
@MohsinJunaidEE 6 жыл бұрын
nice
@vrajverma2804
@vrajverma2804 5 жыл бұрын
How bad it was... Poor explanation
@ProgrammingZone
@ProgrammingZone 4 жыл бұрын
kzbin.info/aero/PLz1fCnmAyf4uctgkU3_yYkXhkkLUQFkwt
@yatendrachawda
@yatendrachawda 5 жыл бұрын
Following wrong format First learn and then explain
Fibonacci Series In Java With Recursion - Full Tutorial (FAST Algorithm)
15:11
C_104 Recursion in C | Introduction to Recursion
18:51
Jenny's Lectures CS IT
Рет қаралды 466 М.
recursion finding factorial of a number
7:10
Satpute Academy
Рет қаралды 59 М.
Fibonacci: Time Complexity | Solved Problems | GateAppliedcourse
7:03
GATE Applied Course
Рет қаралды 55 М.
Mathematical Analysis of Recursive algorithm
15:49
sowmya b
Рет қаралды 1,5 М.
How Many Pawns to BEAT Martin?
25:05
iwantcheckmate
Рет қаралды 22 М.
18-year-old super talent stuns Magnus Carlsen | World Rapid 2024
9:34
ChessBase India
Рет қаралды 204 М.
Stepping Through Recursive Fibonacci Function
8:04
Khan Academy
Рет қаралды 212 М.
Time Complexity analysis of recursion - Fibonacci Sequence
9:28
mycodeschool
Рет қаралды 361 М.
Recursion Algorithm .Tower of Hanoi in C step by step
8:26
Md Sahinul Hoq
Рет қаралды 112 М.
Recursion in C
11:12
Neso Academy
Рет қаралды 969 М.