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-lv5xp4 жыл бұрын
3rd semester also from where you learn dld
@nikhilflautist4 жыл бұрын
This channel helps 1st semester also senior brothers.
@AR-iu1fs3 жыл бұрын
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
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????
@jerujedesu4 жыл бұрын
@@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 :)
@vasubhatt61604 жыл бұрын
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.
@tehuanmelo2 жыл бұрын
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.
@@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
@aparnaranjit17413 жыл бұрын
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 :)
@mickeyvirus45845 жыл бұрын
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 Жыл бұрын
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.
@mubarakhamza71414 жыл бұрын
I love this tutorial , it's way better than payed courses on some other sites
@okik64724 жыл бұрын
*paid
@notrishithakur3 жыл бұрын
*paed
@vipulkumar31623 жыл бұрын
Yes bro
@swapnilsamanta51963 жыл бұрын
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....
@StrawberrMi4 жыл бұрын
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 :>>
@vikassaini19353 жыл бұрын
True
@DaRza172 жыл бұрын
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.
@sathish54702 жыл бұрын
@@DaRza17 bruh what
@DaRza172 жыл бұрын
@@sathish5470 What part of my comment didn't you understand? I meant what I said!
In Future A Lot Innovations would be due to this channel...
@abdul926439334 жыл бұрын
I had a very hard time wrapping my head around recursion, definitely not after this video. Thank you sir!
@hans-erikstenby99203 жыл бұрын
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.
@anojsharma61904 жыл бұрын
I have gone through a lot of youtube videos, but your tutoring in c is the best. Keep up the goodwork
now i can understand the the relationship between the caller and the return. it was not clear, thank you Sir! :)
@aniketkolte89584 жыл бұрын
THE BEST EXPLANATION OF RECURSION TOPIC ON WHOLE KZfaq...RIGHT NOW!!!!WITH BEST ILLUSTRATION OF STACK DIAGRAM ... THANKS SIR !🤗😇🙌🙌🙌🙌🙌
@ReddoX305 жыл бұрын
Thank you for the video. It helped me understand the recursive function used in Towers of Hanoi!
@toufik64423 жыл бұрын
I love that sentence "recursion is not the science of rocket", we always say this sentence in Algeria to express simplicity of something hhhhhhh
@rsingh62163 жыл бұрын
In india we also say , "There is no rocket science".
@abdousaadi27153 жыл бұрын
1 2 3 viva algerie ههههههه
@dikshakatake57394 жыл бұрын
Channel like yours encourages me to learn everything from KZfaq ! Your efforts are seen ! Truly AWESOME ! THANKYOU SO MUCH !!!!🙌🙌
@nathanaelmoh58482 ай бұрын
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!!!
@varunbiju68703 жыл бұрын
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.
@shutdahellup694202 жыл бұрын
so fkn true
@anveshatagore5423 жыл бұрын
This is the advantage of learning from a GATE aspirant.. He will take u to the depths of the topic 🙏🙏🙏🙏
@sumanmitra2024 жыл бұрын
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!!🤘
@lalitdesai63218 ай бұрын
I guess this is the best explanation of recursion so far, even cs50 couldn't explain it better !
@rothenbergt5 жыл бұрын
Was learning recursion last night. What a pleasant surprise. Great video as always!
@ubermanushyan2 жыл бұрын
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
@arunaagt82294 жыл бұрын
The way you teaching is awesome. And it's crystal clear! Thanks a lot!!! The answer is 15.
@ezhilv43584 жыл бұрын
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.
@arunaagt82294 жыл бұрын
@@ezhilv4358 I will tell you
@ezhilv43584 жыл бұрын
@@arunaagt8229 thank u .but can u give me within today?
@arunaagt82294 жыл бұрын
@@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-dz3bx6 ай бұрын
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. 😇😇
@US252135 жыл бұрын
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👍
@LostOnceLefthanded3 жыл бұрын
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!
@abhishekchaturvedi98554 жыл бұрын
Finally I understand recursion & every aspect of it. Thank you..!!!
@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.
@ajitkumarsingh90765 жыл бұрын
God bless you man!! I was looking for this kind of explanation. many many thanks👍👍👍
@sunstrumsharam53882 ай бұрын
I didn't know what recursion was, I watched this video, and I instantly understand it, a really good video.
@sandipdas56842 жыл бұрын
15 is the answer. please tell me I am right or wrong.
@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.
@diwakarkumar98354 жыл бұрын
Your way of teaching can help me a lot to understand the complex topic in a easier way
@sangitakabir94204 жыл бұрын
i cant believe recursion is so easy after i saw the video...very good explanation...thank u so much sir
@Code_Solver4 жыл бұрын
Thank you Neso Academy, you helped me to understand this concept
@julian34006 ай бұрын
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
@ishrarchowdhury48504 жыл бұрын
I can understand the topic literally after 2 months -,- THANKUUU
@vikassaini19353 жыл бұрын
true!
@LINA-tf8yi2 жыл бұрын
it's really fascinating how good you explain and how clear u make concepts,
@VISHALSHARMA-bf4ol4 жыл бұрын
THIS IS THE BEST CHANNEL FOR LEARNING ALSO ANS IS 15
@satyamranjan66184 жыл бұрын
Literally, I have seen many videos, but you people have explained the best , thanks..
@sidharthasoka59184 жыл бұрын
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.
@muhammadasghar98297 ай бұрын
this is the best possible way in which recursion could've been taught grateful to find this video thanks a lot!!!
@torrenceofaustralia73864 жыл бұрын
This channel is amazing. clear speaking and good graphical representation
@luizhenrique47503 жыл бұрын
Thx indian guy! Hugs from Brazil!
@pubgsgreat34992 жыл бұрын
thank you so much neso academy i have understand this actual logic of recursion after 2 years😀😀🤣🤣😅😅
@biswajitpal71854 жыл бұрын
This is best c programming tutorial on over youtube
@RameshKumar-yk4kl5 жыл бұрын
Thank you very much much simply superb explanation. Ans is C)15.
@preetigajdhane25924 жыл бұрын
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...
@vijaya71705 жыл бұрын
I love ur teaching so much If u can be our teacher we will be best engineers😊
@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 : )
@erikchen68833 жыл бұрын
Simplified and thorough. Thank you so much!
@ayushiyadav16 ай бұрын
neso hai toh mumkin hai!! u guys r legit gem!! loveee
@ratnamdevarapalli60755 жыл бұрын
Good explanation. Good visuals. Easy to understand. Thank you very much.
@just_a_boy_who_love_watchi48996 ай бұрын
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.
@praveenpatel99725 жыл бұрын
C. 15 7 + fun(2) 7+fun(0) fun(2) = 7+1 7+7+1 = 15
@beingaware435 жыл бұрын
How to calculate value of function 2?
@praveenpatel99725 жыл бұрын
@@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.
@tushar78934 жыл бұрын
@@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
@sukhbeersingh58113 жыл бұрын
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☝️
@andersonsoaresduclos4 жыл бұрын
Obrigado, pela aula. Excelente explicação 🙏🏻
@adityapanchal5685 Жыл бұрын
@aniketsinha28263 жыл бұрын
one of the best recursion video on youtube
@drewphillips32413 жыл бұрын
This is unbelievably helpful... ... Right? Right!
@niteshkumarmehta93583 жыл бұрын
Ans: 15
@narjatechnologies4 жыл бұрын
awesome and mind blowing explanation
@Dileep_GK5 жыл бұрын
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
@joshnathanielarcilla61278 ай бұрын
I've been doing for loops to get a value and recursion makes my life more efficient bro. Thank you very much 😭😭😭
@sharathkumar19784 жыл бұрын
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-wv9zn5 жыл бұрын
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....
@jhn91085 жыл бұрын
wow!!! what an excellent explanation good job!
@compilerrun55164 жыл бұрын
Hor dasso kiniya tarriffa chaidiya tennu.....😁 thanks Alot Sir🙏
@jcwarain7894 жыл бұрын
God bless this channel. Thank you sir :)
@shutdahellup694202 жыл бұрын
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.
@andiamakaza244 жыл бұрын
U are doing great work.
@udittiwari84094 жыл бұрын
this is best channel for Cs and the way sir explain is next level
@bindhushreeg17583 жыл бұрын
True exactly 😇
@sujeetkumargupta57905 жыл бұрын
Thank you sir..god bless you❤..
@tinkukumarsiddharth22813 жыл бұрын
Thanks to all of you for this channel,I really learned a lot from here🙏
@jmsstudio9982 Жыл бұрын
Take love neso academy.❤️
@KevinPhilip7778 ай бұрын
Holy shit, dude, I had no idea how tf recursion worked until I saw your video. God bless.
@santhu97175 жыл бұрын
God level explanation Thankyou sir
@JohnOdunayo2 жыл бұрын
Thanks for this. I was stuck at the recursion example in CS50's lecture 3. This expounded perfectly.
@nikhilGaming189743 жыл бұрын
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..
@studyaspirants4132 жыл бұрын
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 Жыл бұрын
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)
@vigotech99952 жыл бұрын
I have been able to solve recursive problems in C because of the approach taught in this video, Thank you so much.
@shashank68035 жыл бұрын
15 SOLUTION := (SEE FROM BOTTOM TO TOP) 7+fun(2) // 7+8 then 7+fun(0) // 7+1 so . ' . fun(0)=1
@pranjalmukherjee4 жыл бұрын
Best explanation of working of recursion yet on KZfaq 👍👍
@SudilHasitha5 жыл бұрын
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 Жыл бұрын
yes 🙌 some relief to me after understanding recursion and required practise .
@subhankarsahoo37083 жыл бұрын
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 Жыл бұрын
Ur answer was pretty helpful😢👍
@edm-jt2gy11 ай бұрын
wow, many thanks for the author of this videos, now i understand how recursive works, u explain it very well, thank you
@user-fg1ix4pj6i3 жыл бұрын
F*CKKKKK. finally, THANKS SO MUCH MAAAAAN!
@sweatyhands98303 жыл бұрын
This is by far the best video about recursion on youtube.
@jonnalagaddasujith50895 жыл бұрын
Hi bro 15 is the answer
@vasilvasilev62253 жыл бұрын
this channel is pure gold!
@abhishekshetty89624 жыл бұрын
u sometimes sound like barjirao mastani wala ranveer singh