The Call Stack is a mechanism used by programming engines to keep track of function execution. It works on the LIFO (Last In, First Out) principle, meaning the last function added is the first one to be completed.
How it works:
• When a function is invoked, it is pushed onto the stack.
• The engine starts executing the code of that function.
• If that function calls another one, the new one is pushed on top.
• When a function finishes, it is popped off, and the engine moves back to the function below it.
Problem it solves:
It solves the issue of execution context. It ensures the program "remembers" exactly where to return after a nested function finishes, preventing the code from getting lost.
Simple Scenario:
If
First() calls Second():1.
First() is pushed to the stack.2.
Second() is pushed on top of First().3.
Second() completes and is removed.4. The engine returns to
First() to finish its remaining code.5.
First() is removed once done.
