Recursion in C

  Рет қаралды 909,693

Neso Academy

Neso Academy

Күн бұрын

Пікірлер: 1 100
@karthikshinde6739
@karthikshinde6739 5 жыл бұрын
This is the channel for which i pay my Wifi bills!!!!!!!!!!!!!!! Theser the types of channels that need to be supported this channel helped me a lot in 4th,5th and 6th sem subjects Thanks a lot!!!!!!!!!!!!
@rahulsingh-lv5xp
@rahulsingh-lv5xp 4 жыл бұрын
3rd semester also from where you learn dld
@nikhilflautist
@nikhilflautist 4 жыл бұрын
This channel helps 1st semester also senior brothers.
@AR-iu1fs
@AR-iu1fs 3 жыл бұрын
Yes and we can support Neso Academy by subscribing to channel, giving likes to every video of the course and by recommending neso academy to our friends. Also by following them on social media
@sohamshinde1258
@sohamshinde1258 3 жыл бұрын
Hi
@stevefox2318
@stevefox2318 3 жыл бұрын
So true man
@prafful_sahu
@prafful_sahu 4 жыл бұрын
Fun4 = 7 + fun2 Fun2 = 7 + fun0 Fun0 = 1 Fun4 = 7+7+1 = 15
@muhibosmani4838
@muhibosmani4838 4 жыл бұрын
Bro its wrong
@roushanmondal2021
@roushanmondal2021 4 жыл бұрын
@@muhibosmani4838 No, he is write output is 15
@shrirangjoshi6981
@shrirangjoshi6981 4 жыл бұрын
It's right
@davidecheagaray2256
@davidecheagaray2256 4 жыл бұрын
What I'm wondering is the 7+7 Fun 4 runs false Fun 2 runs false Fun 0 is true so it returns 1 Just so I'm clear that would be 7 from the first false, 7 from the second false, and one from the true making 15????
@jerujedesu
@jerujedesu 4 жыл бұрын
@@davidecheagaray2256 no, when n=0 then it returns back to the caller, which is fun(2)...then fun(2) becomes 1. 7+1=8 and return 8 returns back to the caller which is fun(4)...7+8 is 15 and that is the end and the output :)
@vasubhatt6160
@vasubhatt6160 4 жыл бұрын
Generally, I only concern with my own business, BUT after watching your videos duh, I couldn't stop myself from commenting and appreciating you guys. You have been doing such a fantastic job; your channel must deserve appreciation and recognition from all over the globe. Thank you very much for providing such quality content.
@tehuanmelo
@tehuanmelo 2 жыл бұрын
Output - 15 I was scared about this topic, and I wasn't able to understand it. You made it so easy. Thanks a lot NesoAcademy.
@afriduzzaman544
@afriduzzaman544 5 жыл бұрын
Ans 15 fun(4) return 7+fun(2)//15 return 7+fun(0)//8 return 1//1 Output - 15
@sandisombanjwa2813
@sandisombanjwa2813 3 жыл бұрын
yes its 15 fun
@msvivek1996
@msvivek1996 3 жыл бұрын
@34. Pragati S fun(2) is replaced by their previous return value 8..so it will return 7+8
@techtipsinkannada2.035
@techtipsinkannada2.035 3 жыл бұрын
How return 7+fun(2) = 15 can you elaborate
@moutasemhussain
@moutasemhussain 3 жыл бұрын
@@techtipsinkannada2.035 fun(2)=8 Return 7. Return 7 + fun(2) 7+8 =15
@tejaswini2258
@tejaswini2258 3 жыл бұрын
@@techtipsinkannada2.035 here fun(4) = return 7 + fun(2) //7+8 where fun(2)=return 7 + fun (0) //7+1 where fun (0) = return 1 // at which the "if" condition is true
@aparnaranjit1741
@aparnaranjit1741 3 жыл бұрын
Am a kind of person who was afraid of coding, but after watching Neso academys course, i feel confident enough to do programming. Its really really the best tutorial of C :)
@mickeyvirus4584
@mickeyvirus4584 5 жыл бұрын
Neso academy..... Doing very appreciating effort to learn us computer science..... Let me say value of effort..... This means alot to me..... My exams are coming.... M learning toc tutorial from NA.... Guys very appreciating tutorials video..... Thanks alot..... We should keep support neso.... Love you sir..... 😃
@Onkar895
@Onkar895 Жыл бұрын
I've been struggling with the concept of recursion for the past two days. But after seeing this video, I can say that I have learned it very easily and quickly. Thank you sir for the great explanation.
@mubarakhamza7141
@mubarakhamza7141 4 жыл бұрын
I love this tutorial , it's way better than payed courses on some other sites
@okik6472
@okik6472 4 жыл бұрын
*paid
@notrishithakur
@notrishithakur 3 жыл бұрын
*paed
@vipulkumar3162
@vipulkumar3162 3 жыл бұрын
Yes bro
@swapnilsamanta5196
@swapnilsamanta5196 3 жыл бұрын
Forget Coaching Institutions... Forget Tutorials.... The Content U will Get From KZfaq and Channels like *NESO ACADEMY* are Mind Boggling...❤️❤️ Thank you Neso Académie... I don't want Programming Certificates by Going to Coaching class.. I want pure Knowledge.. And u supplying it FREE OF COST.! for us. Is only an act of Kindness and sharing knowledge. 😊😊🙏❤️❤️❤️❤️.. May ur Channel live for Ages....
@StrawberrMi
@StrawberrMi 4 жыл бұрын
I was having a hard time understanding this lesson, I just couldn’t understand even I kept on watching and reading. But then I saw this, it help me visualize everything. Thank you so muchh! Your tutorial’s the best :>>
@vikassaini1935
@vikassaini1935 3 жыл бұрын
True
@DaRza17
@DaRza17 2 жыл бұрын
The fact that you wear a face mask to take a picture of yourself, is proof for insufficient IQ. Maybe you should learn stuff that's more suitable to your abilities, like mopping floors or bagging groceries at Walmart. It will save you a lot of frustration.
@sathish5470
@sathish5470 2 жыл бұрын
@@DaRza17 bruh what
@DaRza17
@DaRza17 2 жыл бұрын
@@sathish5470 What part of my comment didn't you understand? I meant what I said!
@sathish5470
@sathish5470 2 жыл бұрын
@@DaRza17 why are you rude ?
@Arriction
@Arriction 4 жыл бұрын
c) 15 , n=4 return 7+fun(2) n=2 ,return 7+fun(0) n=0, return 1 7+7+1=15
@inamzarkani5536
@inamzarkani5536 3 жыл бұрын
In Future A Lot Innovations would be due to this channel...
@abdul92643933
@abdul92643933 4 жыл бұрын
I had a very hard time wrapping my head around recursion, definitely not after this video. Thank you sir!
@hans-erikstenby9920
@hans-erikstenby9920 3 жыл бұрын
before i found this channel i coud not see how i was going to pas my exsam i december., but now i i my hope back. even throu i have used one day to just remeber all of what he is explaining the same way, i gues i have underston allot in c programing for my tasks that i have to deliver.
@anojsharma6190
@anojsharma6190 4 жыл бұрын
I have gone through a lot of youtube videos, but your tutoring in c is the best. Keep up the goodwork
@EssamHTA
@EssamHTA Жыл бұрын
result= 15 return 7 + fun(2) =7+8 = 15 return 7+ fun(0) = 7+1 =8 return 1
@viethungho2363
@viethungho2363 Жыл бұрын
I dont understand why 7+8
@shahriarsarthok4679
@shahriarsarthok4679 Жыл бұрын
correct
@tejuchavan3744
@tejuchavan3744 5 жыл бұрын
Option c. 15 fun(4) -> return 7+fun(2) -> return 7+fun(0) ->return 1 fun(2) = 7+1 = 8 fun (4) = 7+8=15 output = 15
@tholapiyasaswini9270
@tholapiyasaswini9270 3 жыл бұрын
How you get 1 and 8
@tholapiyasaswini9270
@tholapiyasaswini9270 3 жыл бұрын
Ok I did understood
@sakthivel_duraisamy
@sakthivel_duraisamy 2 жыл бұрын
tq brother
@MrMarkgyuro
@MrMarkgyuro 5 жыл бұрын
now i can understand the the relationship between the caller and the return. it was not clear, thank you Sir! :)
@aniketkolte8958
@aniketkolte8958 4 жыл бұрын
THE BEST EXPLANATION OF RECURSION TOPIC ON WHOLE KZfaq...RIGHT NOW!!!!WITH BEST ILLUSTRATION OF STACK DIAGRAM ... THANKS SIR !🤗😇🙌🙌🙌🙌🙌
@ReddoX30
@ReddoX30 5 жыл бұрын
Thank you for the video. It helped me understand the recursive function used in Towers of Hanoi!
@toufik6442
@toufik6442 3 жыл бұрын
I love that sentence "recursion is not the science of rocket", we always say this sentence in Algeria to express simplicity of something hhhhhhh
@rsingh6216
@rsingh6216 3 жыл бұрын
In india we also say , "There is no rocket science".
@abdousaadi2715
@abdousaadi2715 3 жыл бұрын
1 2 3 viva algerie ههههههه
@dikshakatake5739
@dikshakatake5739 4 жыл бұрын
Channel like yours encourages me to learn everything from KZfaq ! Your efforts are seen ! Truly AWESOME ! THANKYOU SO MUCH !!!!🙌🙌
@nathanaelmoh5848
@nathanaelmoh5848 2 ай бұрын
This is the first video I have ever watched from your channel on one of the topics that has eluded me the most in programming. In 7 minutes you have explained something that for years I haven't been able to comprehend fully. I don't know how to thank you but one day I might make a contribution to some open source program and I will credit you if I use recursiveness. I absolutely loved the way you showed it so clearly with the stack diagram. When you said it's not rocket science you would not believe my huge smile at that moment because that's exactly how I felt! Thank you to the narrator and everyone involved in this channel!!!
@varunbiju6870
@varunbiju6870 3 жыл бұрын
Finally understood recursion , thank you man. I watched different videos on this topic and managed to get bits and pieces about recursion from each of them. But when I finally watched your video, everything just clicked.
@shutdahellup69420
@shutdahellup69420 2 жыл бұрын
so fkn true
@anveshatagore542
@anveshatagore542 3 жыл бұрын
This is the advantage of learning from a GATE aspirant.. He will take u to the depths of the topic 🙏🙏🙏🙏
@sumanmitra202
@sumanmitra202 4 жыл бұрын
Neso academy you guys are doing awesome... I am fresher in CSE and recursion for fresher is tough.. but you guys mske it interesting and easy.. Go on!!🤘
@lalitdesai6321
@lalitdesai6321 8 ай бұрын
I guess this is the best explanation of recursion so far, even cs50 couldn't explain it better !
@rothenbergt
@rothenbergt 5 жыл бұрын
Was learning recursion last night. What a pleasant surprise. Great video as always!
@ubermanushyan
@ubermanushyan 2 жыл бұрын
That Method 2 man..!! I don't know why I have been struggling to understand this simple thing until now Best Explaination I Have Ever Heard
@arunaagt8229
@arunaagt8229 4 жыл бұрын
The way you teaching is awesome. And it's crystal clear! Thanks a lot!!! The answer is 15.
@ezhilv4358
@ezhilv4358 4 жыл бұрын
Bro I want to know the code for finding 2nd highest no. In a given integer..example 56879 in this value we have to find the 2nd highest no.
@arunaagt8229
@arunaagt8229 4 жыл бұрын
@@ezhilv4358 I will tell you
@ezhilv4358
@ezhilv4358 4 жыл бұрын
@@arunaagt8229 thank u .but can u give me within today?
@arunaagt8229
@arunaagt8229 4 жыл бұрын
@@ezhilv4358 //finding second largest number by comparing difference #include int main() { int n,large=-32768; //-32,768 is the smallest integer in c printf("Enter an integer: "); scanf("%d",&n); //Getting user input int y; y=n; int x; x=n; // Here i am assiagning n value into x for process.. so that the given value won't change further while(n>0) //it checks whether n having a digits. if condition is true, loops gets execute { x=n%10; //Taking last digit if(large>>>>>>>>UPTO THIS YOU FINDING A Largest NUMBER>>>>>>>>>> //>>>>>>>HERE YPU GONNA FIND 2ND LARGEST NUMBER>>>>>>>>>>> int Actual=32768; // it is for finding difference int second_large,difference,z; while(y>0) //here you taking a given value as it is like 123 { z=y%10; //here first time z value is 3 then 2 then 1 if(large==z) //here you comapring 3 with 3 ,and 3 with 2 ,and 3 with 1 { //do nothing.. } else { difference=large-z; / if(Actual>difference) { Actual=difference; second_large=z; } } y=y/10; //first time -- 123/10; 2nd time -- 12/10; 3rd time-- 1/10; } printf("second_large number is:%d ",second_large); /* logic: I am comparing difference with largest value .. here 3 is largest.. so everytime i am taking difference. 3-3 do nothing; then 3-2 =1 ,the 3-1 = 2; HERE 1 IS THE LEAST VALUE ,SO IT PRINT CORRESPONDING VALUE THAT IS ------------2----------- return 0; } /* HERE IS THE SAMPLE OUTPUT: Enter an integer: 45678 Largest number is:8 second_large number is:7 */ Hope you can understand.
@AmitMishra-dz3bx
@AmitMishra-dz3bx 6 ай бұрын
If n is equal to 0, it returns 1. Otherwise, it returns 7 plus the result of calling fun(n - 2). In main, the fun function is called with the argument 4. So let's trace through the function calls: fun(4) calls fun(2) and returns 7 + fun(2). fun(2) calls fun(0) and returns 7 + fun(0). fun(0) returns 1. So, fun(2) returns 7 + 1 = 8. fun(4) returns 7 + 8 = 15. Therefore, the output of the program will be 15. 😇😇
@US25213
@US25213 5 жыл бұрын
Owowwwwwwww!!! I get it now! Thank you soooooo much! First time saw your channel and you made me understand recursion( which made my head spin around) in one go. I subscribed right away. Thanksalot👍
@LostOnceLefthanded
@LostOnceLefthanded 3 жыл бұрын
OMFG I FINALLY understood the recursion after browsing 17 different videos and articles, this explanation finally hit it home. It's not actively changing the function, it's merely putting the old calclation on hold until it can figure out all of thew parameters for it. Thank you so much!
@abhishekchaturvedi9855
@abhishekchaturvedi9855 4 жыл бұрын
Finally I understand recursion & every aspect of it. Thank you..!!!
@noodlechan_
@noodlechan_ Жыл бұрын
This is the best channel to learn C programming language. Just before I was struggling in trying to learn and understand how to make linked lists, I learned just by watching those videos.
@ajitkumarsingh9076
@ajitkumarsingh9076 5 жыл бұрын
God bless you man!! I was looking for this kind of explanation. many many thanks👍👍👍
@sunstrumsharam5388
@sunstrumsharam5388 2 ай бұрын
I didn't know what recursion was, I watched this video, and I instantly understand it, a really good video.
@sandipdas5684
@sandipdas5684 2 жыл бұрын
15 is the answer. please tell me I am right or wrong.
@True_Sachin21
@True_Sachin21 Ай бұрын
First iteration:- int n = 4 , If case is false so , we return 7+fun(n-2) -> 7+fun(2) ; Than pass int 2 so iteration will be 7+fun(0) , fun 0 will return 1 and we get 7+1 = 8 the value of fun(2) and final answer will be 7+8 = 15.
@diwakarkumar9835
@diwakarkumar9835 4 жыл бұрын
Your way of teaching can help me a lot to understand the complex topic in a easier way
@sangitakabir9420
@sangitakabir9420 4 жыл бұрын
i cant believe recursion is so easy after i saw the video...very good explanation...thank u so much sir
@Code_Solver
@Code_Solver 4 жыл бұрын
Thank you Neso Academy, you helped me to understand this concept
@julian3400
@julian3400 6 ай бұрын
Best explanation on Recursion i've watched so far. Have taken CS50 and my universities slides, but still didnt get it. This is my second video on youtube and I finally understand it! Thank you so much
@ishrarchowdhury4850
@ishrarchowdhury4850 4 жыл бұрын
I can understand the topic literally after 2 months -,- THANKUUU
@vikassaini1935
@vikassaini1935 3 жыл бұрын
true!
@LINA-tf8yi
@LINA-tf8yi 2 жыл бұрын
it's really fascinating how good you explain and how clear u make concepts,
@VISHALSHARMA-bf4ol
@VISHALSHARMA-bf4ol 4 жыл бұрын
THIS IS THE BEST CHANNEL FOR LEARNING ALSO ANS IS 15
@satyamranjan6618
@satyamranjan6618 4 жыл бұрын
Literally, I have seen many videos, but you people have explained the best , thanks..
@sidharthasoka5918
@sidharthasoka5918 4 жыл бұрын
Thanks a lot for explaining this topic in such a simple way. When I first learnt recursive functions, I couldnt understand it but now i do, because of you.
@muhammadasghar9829
@muhammadasghar9829 7 ай бұрын
this is the best possible way in which recursion could've been taught grateful to find this video thanks a lot!!!
@torrenceofaustralia7386
@torrenceofaustralia7386 4 жыл бұрын
This channel is amazing. clear speaking and good graphical representation
@luizhenrique4750
@luizhenrique4750 3 жыл бұрын
Thx indian guy! Hugs from Brazil!
@pubgsgreat3499
@pubgsgreat3499 2 жыл бұрын
thank you so much neso academy i have understand this actual logic of recursion after 2 years😀😀🤣🤣😅😅
@biswajitpal7185
@biswajitpal7185 4 жыл бұрын
This is best c programming tutorial on over youtube
@RameshKumar-yk4kl
@RameshKumar-yk4kl 5 жыл бұрын
Thank you very much much simply superb explanation. Ans is C)15.
@preetigajdhane2592
@preetigajdhane2592 4 жыл бұрын
Thanks sir ...such a excellent explaination sir , I never understand recursion before...and each and every concepts that you explain are very easy to understand...
@vijaya7170
@vijaya7170 5 жыл бұрын
I love ur teaching so much If u can be our teacher we will be best engineers😊
@r17122mahendra
@r17122mahendra Жыл бұрын
Super sir I have confusion of recursion since my B.tech 1st year now I am in final year and solved my confusion TQ you cheers : )
@erikchen6883
@erikchen6883 3 жыл бұрын
Simplified and thorough. Thank you so much!
@ayushiyadav1
@ayushiyadav1 6 ай бұрын
neso hai toh mumkin hai!! u guys r legit gem!! loveee
@ratnamdevarapalli6075
@ratnamdevarapalli6075 5 жыл бұрын
Good explanation. Good visuals. Easy to understand. Thank you very much.
@just_a_boy_who_love_watchi4899
@just_a_boy_who_love_watchi4899 6 ай бұрын
The function fun is called with an argument of 4. Since 4 is not equal to 0, it goes to the else part and returns 7 + fun(2). Now, fun(2) will again return 7 + fun(0). Finally, fun(0) returns 1. So, the total becomes 7 + 7 + 1 = 15.
@praveenpatel9972
@praveenpatel9972 5 жыл бұрын
C. 15 7 + fun(2) 7+fun(0) fun(2) = 7+1 7+7+1 = 15
@beingaware43
@beingaware43 5 жыл бұрын
How to calculate value of function 2?
@praveenpatel9972
@praveenpatel9972 5 жыл бұрын
@@beingaware43 fun(2)=7+fun(2-2)=7+fun(0) 7+1 fun(2)=8 Here fun(0) returning value 1, thats why fun(2) returns 8.
@tushar7893
@tushar7893 4 жыл бұрын
@@praveenpatel9972 1st call fun(4) =7+fun(4-2) =7+fun(2) Again fun(2)=fun(2-2)=7+fun(0)=7 How the calculation to get answer is 15 please explain
@sukhbeersingh5811
@sukhbeersingh5811 3 жыл бұрын
The output of the homework problem is 15. As, fun(4)👉15//final output 👍 return 7 + fun(2)👉8☝️ return 7 + fun(0)👉1☝️ return 1 👉1☝️
@andersonsoaresduclos
@andersonsoaresduclos 4 жыл бұрын
Obrigado, pela aula. Excelente explicação 🙏🏻
@adityapanchal5685
@adityapanchal5685 Жыл бұрын
@aniketsinha2826
@aniketsinha2826 3 жыл бұрын
one of the best recursion video on youtube
@drewphillips3241
@drewphillips3241 3 жыл бұрын
This is unbelievably helpful... ... Right? Right!
@niteshkumarmehta9358
@niteshkumarmehta9358 3 жыл бұрын
Ans: 15
@narjatechnologies
@narjatechnologies 4 жыл бұрын
awesome and mind blowing explanation
@Dileep_GK
@Dileep_GK 5 жыл бұрын
Great full to you guys done awesome job 😍😍😍 kudos to the expliner and the best slide maker 😎😎 looking forward many more videos on cpp and c
@joshnathanielarcilla6127
@joshnathanielarcilla6127 8 ай бұрын
I've been doing for loops to get a value and recursion makes my life more efficient bro. Thank you very much 😭😭😭
@sharathkumar1978
@sharathkumar1978 4 жыл бұрын
Thank you very very much. You are just awesome and made my day. It was so easy to understand the way how i learnt recursion. Along with that it helped me to visualise the stack as well :)
@Karan-wv9zn
@Karan-wv9zn 5 жыл бұрын
C- 15 Another method which i found is check the number of times value will be called and do like:- 7+7+1=15... Pretty much easier....
@jhn9108
@jhn9108 5 жыл бұрын
wow!!! what an excellent explanation good job!
@compilerrun5516
@compilerrun5516 4 жыл бұрын
Hor dasso kiniya tarriffa chaidiya tennu.....😁 thanks Alot Sir🙏
@jcwarain789
@jcwarain789 4 жыл бұрын
God bless this channel. Thank you sir :)
@shutdahellup69420
@shutdahellup69420 2 жыл бұрын
Ive watched more than 5 tutorials and this one was hands down the best one. finally at last i was able to understand this satanic topic. think im gonna cry. but foreal tho, thanks alot.
@andiamakaza24
@andiamakaza24 4 жыл бұрын
U are doing great work.
@udittiwari8409
@udittiwari8409 4 жыл бұрын
this is best channel for Cs and the way sir explain is next level
@bindhushreeg1758
@bindhushreeg1758 3 жыл бұрын
True exactly 😇
@sujeetkumargupta5790
@sujeetkumargupta5790 5 жыл бұрын
Thank you sir..god bless you❤..
@tinkukumarsiddharth2281
@tinkukumarsiddharth2281 3 жыл бұрын
Thanks to all of you for this channel,I really learned a lot from here🙏
@jmsstudio9982
@jmsstudio9982 Жыл бұрын
Take love neso academy.❤️
@KevinPhilip777
@KevinPhilip777 8 ай бұрын
Holy shit, dude, I had no idea how tf recursion worked until I saw your video. God bless.
@santhu9717
@santhu9717 5 жыл бұрын
God level explanation Thankyou sir
@JohnOdunayo
@JohnOdunayo 2 жыл бұрын
Thanks for this. I was stuck at the recursion example in CS50's lecture 3. This expounded perfectly.
@nikhilGaming18974
@nikhilGaming18974 3 жыл бұрын
You guys are gem.The way of teaching is amazing ,even though I thought I knew recursion but after coming here I came to know that I had understood recursion in a wrong way espicially that stack thing was amazing ...May your channel grow and grow and grow.....Gud luck..
@studyaspirants413
@studyaspirants413 2 жыл бұрын
first of all thanks so much , I couldn't understand recursion last 3 days after learn recursion but after some search . I am here and understand actually how recursion work step by step . again thanks a lot brother.
@yaminisettipalli3554
@yaminisettipalli3554 Жыл бұрын
15 is the output 🤟 Fun 4=return 7+fun2 Fun 2=return 7+fun 0 Fun 0= 1 Fun 4= return 7+return 7 + fun 0 (7+7+1=15)
@vigotech9995
@vigotech9995 2 жыл бұрын
I have been able to solve recursive problems in C because of the approach taught in this video, Thank you so much.
@shashank6803
@shashank6803 5 жыл бұрын
15 SOLUTION := (SEE FROM BOTTOM TO TOP) 7+fun(2) // 7+8 then 7+fun(0) // 7+1 so . ' . fun(0)=1
@pranjalmukherjee
@pranjalmukherjee 4 жыл бұрын
Best explanation of working of recursion yet on KZfaq 👍👍
@SudilHasitha
@SudilHasitha 5 жыл бұрын
ans c) 15 fun (4) return 7+fun (2) return 7+fun (0) return 1 then return 1 go to return 7+1 go to return 7+7+1 go to fun (4) at main giving 15 as answer
@singstarrahul
@singstarrahul Жыл бұрын
yes 🙌 some relief to me after understanding recursion and required practise .
@subhankarsahoo3708
@subhankarsahoo3708 3 жыл бұрын
fun(4) | return 7 + fun(2) // 15 [value of fun(4)] | return 7 + fun(0) // 8 [value of fun(2)] | return 1 // value of fun(0) So the final answer is 15.
@SoniaCharlesShorts
@SoniaCharlesShorts Жыл бұрын
Ur answer was pretty helpful😢👍
@edm-jt2gy
@edm-jt2gy 11 ай бұрын
wow, many thanks for the author of this videos, now i understand how recursive works, u explain it very well, thank you
@user-fg1ix4pj6i
@user-fg1ix4pj6i 3 жыл бұрын
F*CKKKKK. finally, THANKS SO MUCH MAAAAAN!
@sweatyhands9830
@sweatyhands9830 3 жыл бұрын
This is by far the best video about recursion on youtube.
@jonnalagaddasujith5089
@jonnalagaddasujith5089 5 жыл бұрын
Hi bro 15 is the answer
@vasilvasilev6225
@vasilvasilev6225 3 жыл бұрын
this channel is pure gold!
@abhishekshetty8962
@abhishekshetty8962 4 жыл бұрын
u sometimes sound like barjirao mastani wala ranveer singh
@kunalsoni7681
@kunalsoni7681 4 жыл бұрын
world's best COMPUTER SCIENCE teacher
How to write Recursive Functions
9:03
Neso Academy
Рет қаралды 421 М.
10 Math Concepts for Programmers
9:32
Fireship
Рет қаралды 1,8 МЛН
Magic trick 🪄😁
00:13
Andrey Grechka
Рет қаралды 57 МЛН
Glow Stick Secret Pt.4 😱 #shorts
00:35
Mr DegrEE
Рет қаралды 12 МЛН
娜美这是在浪费食物 #路飞#海贼王
00:20
路飞与唐舞桐
Рет қаралды 6 МЛН
C_104 Recursion in C | Introduction to Recursion
20:44
Jenny's Lectures CS IT
Рет қаралды 414 М.
5 Simple Steps for Solving Any Recursive Problem
21:03
Reducible
Рет қаралды 1,2 МЛН
you will never ask about pointers again after watching this video
8:03
Low Level Learning
Рет қаралды 2,1 МЛН
Top Down Parsers - Recursive Descent Parsers
20:24
Neso Academy
Рет қаралды 144 М.
Call By Value & Call By Reference in C
8:34
Neso Academy
Рет қаралды 1,3 МЛН
Types of Recursion (Part 1) | Direct & Indirect Recursion
9:45
Neso Academy
Рет қаралды 274 М.
Special Programs in C − Pyramid of Stars
11:06
Neso Academy
Рет қаралды 860 М.
This is a Better Way to Understand Recursion
4:03
Alex Hyett
Рет қаралды 38 М.
Mastering Dynamic Programming - How to solve any interview problem (Part 1)
19:41
Magic trick 🪄😁
00:13
Andrey Grechka
Рет қаралды 57 МЛН