Java Recursion

[@brandonflorida1092]

You, unlike most teachers, have the brains to understand how to explain things. Thank you.

[@eagerassaultixopi4558]

Even many experienced programmers don't have a deeper understanding of recursion that you have provided

[@mohibbafatima3607]

OMG! I watched like million videos on this topic and this is the only one that makes sense to me. Thank you.

[@rajeevbijalwan5913]

Mohibba Fatima Exactly!

[@dbug6012]

Trust me that's exactly how I felt after watching his OOP tutorials. Really talented at explaining concepts.

[@jenisson159]

Perfect explanation.

[@virusehwag9562]

Million videos???? I think u have watched millions of videos about Make up & beauty that's why it took this much of time

[@electronicsbooster2561]

Millions 🙄 it's enough

[@pragyasingh5880]

This is the simplest and in depth explanation of recursion imo

[@adritarahmantori6439]

I feel so blessed that it pops up automatically into my youtube recomendation

[@philbrainard2784]

I think the explanation of what's happening on the stack makes it all click. This is great.

[@dudeitsme5753]

Sir, I have a doubt, 15:20 so once the if-condition is false, we come out of loop and print the n-value at that point of time, ie -1. Ok, fine. But after printing -1, the program must terminate right, because the print statement is outside the loop. Why are we getting the other values ? imo, the output must be just "Completed call=-1" plz help me understand

[@anhkien4914]

SAME LOL

[@georgemurariu3637]

I think it`s easier if you visualize the methods them as they enter and leave the memory stack. Think of them as an "inception", the method calls itself while being in the "if" block, after that a new method calls itself in the "if" block, until the final one breaks the condition and bypasses the "if" and goes on to "print". After that the method is completed, it exits and backtracks on the memory stack to the previous method which was "stuck" in the "if" block, so it exits the if block and carries on to print and so on. Put a breakpoint on the if condition and run the debugger to see how the compiler "travels" through the code.

[@dinenEhil]

This is the day I got a way closer to understand recursion. Thanks a lot!

[@rkwarrior1765]

From India u are a good teacher

[@Sairam30722]

I see many videos but this video clarifies all of my doubts🙏🙏🙏🙏🙏🙏🙏🙏🙏

[@estiennemustard6903]

Like Fatima, I 'v watched many tutorials, yours have a higher pedagogie level, certainly explained by the mastering of the Java knowledge & your talent. Your are professional.

[@codezier2738]

The only guy that actually explains it, the other videos just show code. Thanks!

[@dennisdavari5050]

I just logged in to say that you explained the video really well and that I finally understand the concept. :D

[@YerushalayimShelZahv]

Thank you for this video. I can't believe it took so long to find someone who can explain this basic concept better. You filled in a lot of gaps for me. I kind of understood the basic idea of how recursion works I just didn't know how exactly the stack plays into it. I hope you keep making more content. Liked and I'm subscribed!

[@void6098]

great enunciation, even better explanation!

[@buhletwetwa2578]

Thank you so much for this video. This really helped me understand recusion better.

[@samuelknightmusic]

You sir have a gift with communication. Thank you!

[@codabowl]

You did such a great, succinct teaching of this! Bravo. Most teachers forget to walk their learners through the stack, and so the concept seems so abstract. You made it concrete and obtainable!

[@srini580]

Imtiaz, keep it up. Thank you! You explained way better than others.

[@bhavinpatel9630]

Very nice and clear receursion explanation, your voice is very clear in all of your videos. Thanks a lot.

[@IluSsIoNnN]

Thank you ! I'm just learning Java now and this was brilliant !

[@eshah3895]

Great and so professional explanation, thank you.

[@computationalbadass]

your voice is so calming

[@backtashmohammadi3824]

Better explained than lot of professors

[@mohamedtraore3119]

Thank you so much brother, please come back for more java videos

[@mb.prathamesh]

Nicely Explained!

[@somanathkumbhar4750]

Thank you so much for very nice explanation. I heard lot of time recursion is so hard but after watching this i don't feel same.. thank you again.

[@murilodemeloreis8210]

Simple and clear! Exactly what I needed to get it. Thank you Imtiaz

[@goldenraisins]

Is recursive-linear-search supposed to be for a double array?

[@venthangowthamsivakumar5510]

Great explanation Imtiaz

[@YouTolan]

where is the second video showing the recursive search method working?

[@Promixro]

I love your videos, i always wonder what mic you are using when you are standing up? :)

[@endchoice1073]

thanks very nice explaination

[@oxanasf6369]

It was a really good explanation!

[@journey2274]

Great​ Explanation .! You Rock

[@codewarriors2543]

Very clear!

[@robertdwyer9243]

Excellent!!!!

[@nirajkumarsingh6184]

Was really helpful, thanks for the help.

[@abhinabachoudhury5843]

Sir The value of n will be 0 after the recursive operations??????

[@inamullah7031]

What I didn't get is the idea of backtracking to it's original, unchanged value through this obvious course of self-invocation and not only this but getting to the statement of getting every new recursive call's consequence to be printed. How would the conditional base case for 0 1 2 3 etc even let every upcoming new value of n go unchecked and make it to the printing statement unless there's -1 to process which of course is a terminating cause.

[@kamalanb6930]

Can we use return in function definition to call itself ?

[@harruram3811]

but why completed call : 10 is getting printed it should be from -1 to 9

[@aminator1]

amazing video, very well taught, thanks Imtiaz!

[@rockyk6805]

Really well-done video! Thanks a lot for your help :)

[@buzztime8199]

best explanation , thank u so much

[@josephmarks5489]

Thank you for this, amazing explanation :)

[@thestarinthesky_]

So helpful and informative. Thanks so much.

[@SudeepSharma27]

hi

[@skumakerguitar8708]

thank you so much sir i have been tried blog and even course in udemy you explanation was very detail and yeaa thanks

[@navyasri4930]

Sir can you please explain...I have a code,why this program gives StackoverflowError .what actually happens in heap and stack area... class Program { Program p=new Program(); Program() { } public static void main(String[] args) { Program p1=new Program(); } }

[@velanganniinbaraj6593]

Really a big thanks to you sir....

[@Eternals11]

what if we write as : reducebyone(n-1){ if(n==0){ return 0; } }

[@aiishwarya2977]

Thankyou soo much!!😃

[@159saur]

Can you please help me to understand a code ?

[@nafisshariar5897]

Thank You sir ! Pls make videos on Linked list and Circular array

[@electrotsmishar]

very nicely explained

[@ericaparkk]

this was so helpful tysm

[@abheekkumarsrivastava1143]

Very well explained. This is awesome. Thank you.

[@aamirjankhan8642]

thank you, many concepts gained.

[@BangMaster96]

mashaallah beautiful explanation

[@teadulellari1764]

That was so good!!

[@DDOMohit]

thank you soo much it helped alot

[@gopalakrishnachitta8262]

Nice video..

[@harshhwardhanrai3716]

why 10 is also getting printed, it should get printed from -1 to 9

[@jitendral1087]

Perfect explanation :)

[@innushbasha434]

Nice Explanation 👍

[@soak2094]

It was helpful, thank you

[@kshitijasray4892]

Could you upload video on binary recursion

[@nihalsingh5558]

Really very useful sir

[@kevingb6778]

Helped me a lot , thank you

[@nemissinha2637]

I m not able to install Eclipse,please send me link.........

[@TheMostHype]

you need java 101 lol

[@jenisson159]

I will send a link to a page with the link 😁😁😁

[@fdusswn8127]

100% recommended

[@supriyasingh9818]

One of the best video :)

[@hakanahlstrom8310]

I see similarities with simple loops. fori/do while/while.

[@OsamaAlatraqchi]

Wonderful, thank you very much

[@prasadbojanapu5093]

good and more understandable..

[@vatsaltripathi2024]

Great accent senior

[@katlegokoma1976]

where is part 2

[@SwikarP]

thanks for an explanation.

[@HowTo-lc2rp]

This video needs a Part 2 to explain when did the S.o.p statement got executed. rest everything is clear.

[@tejeswarv450]

Good explanation

[@路遥-w5w]

very helpful

[@sammathew3332]

Amazing!!

[@hodlboi]

wish i could give this multiple likes

[@JustTheHighlights]

I think the factorial explanation is easier to understand since it's actually solving a problem as opposed to doing recursion just because...

[@Bleachiiigo]

Arigatou Gozimasu

[@ronn1NNNNN]

Awesome

[@anukrativerma9921]

Thanks!

[@nicholasbrigham344]

خیلی خوب

[@k.sshashikala3915]

Nice

[@karthikk1172]

Woahh !

[@deepakjava3506]

thanks thanks thanks

[@psawyer871]

could you make more free videos, please?

[@firstyfirst]

👋

[@dumbt]

my java teacher won't let anyone in our class use Echlipse smh

[@rubberfruit3492]

what a pretty man

[@taariqq]

Aha, missed -1

[@moses.muchemi]

recursion is not easy to understand.. i have been coding for years and i have never used it

[@surajjaiswal2010]

india zindabad afaganistan zindabad

[@JyoSco007]

Are you Indian, Imtiaz? You seem like an Indian.

[@danielrincon6004]

Bruhh am I the only one dying that this foo used foo as an example