Understanding How Recursion Actually Runs (The Call Stack)

In the previous lesson, we learned how to write recursive functions in C. We saw that a recursive function always contains: A base case (when the function stops) A recursive case (when the function