Very Deep or Infinite Recursion
The most common cause of stack overflow is excessively deep or infinite recursion. Languages like Scheme, which implement tail-call optimization, allow infinite recursion of a specific sort—tail recursion—to occur without stack overflow. This works because tail-recursion calls do not take up additional stack space.
An example of infinite recursion in C.
int foo { return foo; }The function foo, when it is invoked, continues to invoke itself, using additional space on the stack each time, until the stack overflows resulting in a segmentation fault.
Read more about this topic: Stack Overflow
Famous quotes containing the words deep and/or infinite:
“A sentence should read as if its author, had he held a plow instead of a pen, could have drawn a furrow deep and straight to the end.”
—Henry David Thoreau (1817–1862)
“I would fain keep sober always; and there are infinite degrees of drunkenness.”
—Henry David Thoreau (1817–1862)