A strong answer
A strong candidate frames What stops a recursive function from calling itself forever? around the exact memory layout, compiler semantics, and hardware execution model covered in Recursion: A Function That Calls Itself. Identify base and recursive cases, trace frame buildup and unwind, and compare naive recursion cost with a loop.
Some problems contain a smaller copy of themselves. The factorial of n is n times the factorial of n minus one. A folder contains files and other folders. A sorted list can be searched by looking at its middle and then searching one half. For problems shaped like this, the simplest solution is a function that solves a small case directly and solves a larger case by calling itself on a smaller one:
This looks suspicious. If every call has a variable called n, how does the function keep them apart? The answer is in lesson 6: each call has its own frame, so each has its own n.
In a production interview, always connect the specification rule to its concrete runtime consequence: state what lives on the stack versus the heap or static storage segment, how the compiler or operating system validates alignments, lifetimes, and error codes, and what happens under adversarial or boundary inputs (such as zero-length buffers, integer overflow, concurrent mutation, or partial I/O). Backing your explanation with a small trace of register/memory state transitions immediately separates senior systems engineers from candidates who only memorized syntax.
What the interviewer is listening for
- Mastery of core invariant: Identify the base case and the recursive case of a recursive function.
- Mastery of core invariant: Trace the stack frames created and released during a recursive call.
- Mastery of core invariant: Explain how a missing or unreachable base case exhausts the stack.
- Hardware and ABI awareness: Explaining how sizes, alignments, calling conventions, or kernel boundaries behave on real 64-bit targets rather than relying on implementation-defined assumptions.
- Defensive engineering: Naming the exact compiler flags (
-Wall -Wextra -Werror), static analyzers, or runtime sanitizers (-fsanitize=address,undefined,thread) that verify correctness in CI.
Common mistakes
- Explaining only surface syntax without tracing the underlying memory addresses, ownership lifetime, or kernel/user-space state transitions.
- Assuming undefined behavior (such as signed overflow, uninitialized reads, strict-aliasing violations, or dangling pointers) will "just work" because it passed an unoptimized
-O0debug build. - Ignoring return codes, partial reads/writes, alignment padding, or cleanup paths when an allocation or syscall fails midway through a function.