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:
“Judicial judgment must take deep account ... of the day before yesterday in order that yesterday may not paralyze today.”
—Felix Frankfurter (1882–1965)
“You need an infinite stretch of time ahead of you to start to think, infinite energy to make the smallest decision. The world is getting denser. The immense number of useless projects is bewildering. Too many things have to be put in to balance up an uncertain scale. You can’t disappear anymore. You die in a state of total indecision.”
—Jean Baudrillard (b. 1929)