browse/
3 results
computers/the-call-stack-why-a-function-that-never-stops-crashes-your-program.md
The call stack: why a function that never stops crashes your program
Every time a function is called, the computer puts a small block of memory called a frame on top of a call stack, and removes it when the…
computer-science/recursion-why-fib-30-makes-2-7-million-calls-and-how-a-notebook-fixes.md
Recursion: why fib(30) makes 2.7 million calls, and how a notebook fixes it
A function that calls itself sounds like an endless loop, but it works when every call gets a smaller problem and one case is simple enough…
computers/the-call-stack-how-your-computer-remembers-where-to-come-back-to.md
The call stack: how your computer remembers where to come back to
When one function calls another, how does the computer remember where to come back to? It keeps a pile of frames called the call stack…