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

Concepts:
What happens in memory on each recursive function call?
Illustration of the individual stack frames on the call stack

[navidgol]

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

[michaeldunleavy]

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

[rashidselemani]

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

[zyro]

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

[sahawndada]

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

[ambujsingh]

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 ❤️

[kicksfromfareast]

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

[nehemiahadeosun]

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

[Ghost-nzfx]

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

[annafebland]

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

[clintrusselopenia]

this is better than my programming professor

[SpawnEmdee]

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

[abdullahsorathia]

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

[JonnyTeck]

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

[dfla]

THANKS !! Precise and simple explanation.

[gazisalahuddin]

a million thanks..keep up the awesome works

[TheHolyReality]

Very well explained, plain, simple and precise. 

[paulm]

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.\n")
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("\nStack is cleared.")
return y

factorial(1, 4)

[elephantride]

easy to undersatnd. ..Thanks for ur effort

[Farrukhw]

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