Data Structures Using C++: Illustration of Recursive Function Calls (Call Stack)

[@navidgol5786]

I don't know why our teacher wants to complicate everything! thank's man that was an awesome video!

[@zyro9922]

No complications. Just concept. Thanks man. Really helpful.

[@rashidselemani475]

I was very confused, but today my confusion get a medecine. Long life to you Sir. I subscribe right now!

[@michaeldunleavy326]

well, that was the best explanation of recursion I've seen. thanks a lot :-)

[@sahawndada]

This is such a good explanation on a tough topic. Thanks for helping me finally get it !

[@nehemiahadeosun5585]

Thank you very much, you've saved a soul today.You are blessed...

[@annafebland4460]

Thank you thank you! May God bless and protect you and your family ❤

[@Ghost-nz4fx]

It's the best explanation ever! A simple explanation and straight to the point. Thank you so much.

[@ambujsingh4406]

I made many programs in java and c and was debugging them with breakpoint to understand how it works and saw many videos wasn't satisfied but in SoloLearn someone had given your video link i don't click on links normally but i had no options either so i wanted to take a chance. And now i understand it how it works thanks man Liked and Subscribed your channel ❤️

[@underrated_mono9770]

I still love this video because intuitive and concise. great video!

[@paulm6084]

Very clear. Mocked up the video in python. Code: def factorial(i,x): print("factorial function invoked. Stack frame #",i,"named: fact(",x,")") if x == 0: print("Base case reached. ") print("factorial function fact(",x,"), returned value:",1," Stack frame #",i, " popped from the stack.") return 1 else: y = x* factorial(i+1,x-1) print("factorial function fact(",x,"), returned value:",y," Stack frame #",i, " popped from the stack.") i-=1 if i == 0: print(" Stack is cleared.") return y factorial(1,4)

[@spicytuna08]

in order to make this video more complete, local variables and the logic usage of these variables are needed. it is not just the arguments that need to be traced but the local variables are very crucial in order to trace the recursion.

[@blinkerhawk]

thx~

[@meditationkaiinsaf5505]

Can you explain please about it?

[@SpawnEmdee]

Thank you! I was having headache understanding recursion. your explanation is the best!!

[@siphiwekarimakwenda9313]

The perfect recursion tutorial!!!!

[@dfla5472]

THANKS !! Precise and simple explanation.

[@TheHolyReality]

Very well explained , plain , simple and precise.

[@wowzande]

good stuff! finally understand recursion! to a certain extent much better then what they taught in class!

[@RacerSteelz]

this was really helpful thanks a lot, didn't understand this for the longest time

[@SidonDuarte]

Really! The best explanation.

[@muhammadawaisbhatti942]

Thank you for the explanation of states of program execution stack during recursion. However, i think what you missed is, focus on control, you forget to tell how control will shift from first recursion call to second recursion call and how did the control will return back for every recursive call.

[@sharphon]

Great explained. Now it's clear why recursive functions are dangerous :D

[@petruciucur]

Very simple and concise. Thanks !

[@abdullahsorathia3394]

Thanks a lot clarifying my doubts.You teach Like a Pro..

[@willwillwill-91]

Great explanation, really helpful, much better than my text book

[@Farrukhw]

Waooo, how simply it gets into my brain.... Thank you very much....

[@elephantride8912]

easy to undersatnd. ..Thanks for ur effort

[@durgapalepu5780]

I liked the pictorial way of explaining the concept!!

[@faris899]

Wish you were my professor

[@vickyees]

Amazing sir! You made it clear!🙏

[@mehedibd89]

Great Explanation! Thanks for your video.

[@richie.edwards]

Very clear explanation. Thanks.

[@pipebomb8562]

fantastic explanation. Impressed

[@nadiahzulkifli3867]

you help me a lot sir! so nervous for the presentation and after watching this, i know how to explain

[@rawanfouda2291]

Just what I needed. Thanks a lot!

[@ar1y3n]

Thanks a lot sir, I just understood the whole thing very easily

[@sunikshitmahajan2198]

amazing explanation. hats off!

[@rogueflynn]

Thank you! This really helped my understanding.

[@gazisalahuddin8681]

a million thanks..keep up the awesome works

[@kazenohito7641]

Jesus christ I hate my school. After watching your video I googled and then read the chapters in my book about stacks and queues and not recursion makes so much more sense. I don't get why my university thinks its ok to try to make us write programs recursively without an understanding of what actually happens with your data.

[@zoranjovanov8564]

u have to look up on ur own.

[@kazenohito7641]

Yeah I know.... That's how I got here. Thank you captain obvious.

[@zoranjovanov8564]

haha that was not the point :d wanted to say school only gives u the very basics and the rest is up to us:P

[@meditationkaiinsaf5505]

@@zoranjovanov8564 thank you

[@sayednaweed745]

Great explanation

[@MrWardo2009]

Thanks for making this video!

[@quyhai1019]

best explanation!

[@abhishekjha2957]

This helped me a lot.

[@trixxter3817]

Super explanation ❤️

[@saptarshisahoo5075]

its very helpful. Thank you sir.

[@Omioblivion]

Great video, yet again.

[@ashok845]

Well explained! Can you please explain merge sort using recursion in the same manner.

[@onealoneal7047]

For the if\else structure you don’t have to use curly braces if you only have single instruction to write

[@VihangaHeshan]

Very useful................

[@TamImBlessed]

You just saved me, thanks for helping.

[@mishanshah6827]

Very nice 👌

[@AlMarufSharif]

Nice explanation!!

[@SillyPlanet92]

great explanation. thank you

[@DavidSprings]

Great way to create deep subdirectories on a drive. Really, really deep. Trust me.

[@DavidSprings]

Patrick Davis I ended up creating subdirectories within subdirectories until either Windows crashed or the drive filled up.

[@dangerrrman]

Thanks for clarifying this topic :-)

[@petruciucur]

Great ! Thanks a lot !

[@Darkion45]

great explanation, thanks!

[@nasircsedu]

it's awesome, man

[@djavadovjavoxir2248]

thank u bro good luck your life!

[@mlungisinkomo2382]

well............ this makes sense 😊thanks man

[@sherif4csharp]

Thanks for your help

[@BharatChandak1]

awesome explanation :)

[@michaelcollins4325]

once again, your videos save my ass; you always explain it better than my professors :D, thanks!

[@MiladZohravi]

very special thanks

[@NZFoxy]

Thank you so much!

[@sarahlakehal3378]

lol watching this 3 hours before my exam

[@petesandwich3246]

Would iterative function utilize less memory since it essentially increments a variable rather than creating N stacks?

[@ozzy2361]

Thank you so much!!

[@kirolosyassa5798]

it was so helpful :)

[@unplugged406]

God bless you son

[@Richard-yz2gy]

hi there what happens if a value is not getting returned to the previous stack frame??

[@apurvatiwari2]

Thanks a lot mate!!!!!!

[@jorgetadeo510]

What would be the run time and space complexity of this?

[@noreplywiggle42]

nice man

[@Malak_95y]

thank you so much

[@supreethavadhani8916]

helped a lot!

[@hortinus]

What if n

[@kashif2309]

how come num equals to n in the factorial function?

[@ManishKumar-kc1cn]

Thanks sir

[@artteaparty]

That's a great video, just I have a problem. Sometimes in some program it happens that the result of Recursive Function comes backward. You know, like instead of printing 1 2 3 ..., prints 3 2 1. Can you give some hints?

[@Kalo953]

+sasa february in order to understand why it happens you need to understand the call stack and what happens when you have statements after the recursive call of the function.

[@meditationkaiinsaf5505]

Cause, Stack follows FIFO (First In First OUT).Thank you

[@logeshs9370]

nice expl

[@sunflower20505]

thank you.

[@Strategic.]

Dude you still alive? Have you built anything amazing so far?

[@harshitpatnaik6381]

Thank you vry much

[@SearchingPeaceInside]

What happens to rbp, rsp in assembly

[@ghostinthedarkness30]

thank you!!!

[@MegaCooloman]

Could we have chosen n == 1 as a base case? seems like it would work but is it bad design? Pardon my bad English !!

[@GrandofTheftHero]

Sorry for the late reply; you may have already found the answer to your question. You can technically get the same result with a base case of (n==1), but it makes more mathematical sense to make it (n==0), because the factorial of 0 is 1.

[@meditationkaiinsaf5505]

@@GrandofTheftHero Thanks for clear me.

[@LuaneCarolineAquinoCavalcanti]

thanks a lot

[@gluetubeserver]

+Luane Caroline Aquino Cavalcanti are you in CS?

[@LuaneCarolineAquinoCavalcanti]

+RepentHarlequin yes !! third year

[@gluetubeserver]

Luane Caroline Aquino Cavalcanti wow! You are a unicorn, not many females in tech right now, way to go!

[@LuaneCarolineAquinoCavalcanti]

+RepentHarlequin thats right, but is changing, thats nice

[@Icecube88]

first one in, last one out.

[@ilayasaravanan]

Amazing video mate. Helped understand recursion. Until I saw this illustration, I have to say, my grasp of recursion was dodgy.

[@pixelnetwork1430]

Looks like 4x Fart (3)

[@padmanabhmishra9669]

Thank you.