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:
“I am not sure that it is of the first importance that you should be happy. Many an unhappy man has been of deep service to himself and to the world.”
—Woodrow Wilson (1856–1924)
“The process of writing has something infinite about it. Even though it is interrupted each night, it is one single notation.”
—Elias Canetti (b. 1905)