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:
“An old French sentence says, “God works in moments,”M”En peu d’heure Dieu labeure.” We ask for long life, but ‘t is deep life, or grand moments, that signify. Let the measure of time be spiritual, not mechanical.”
—Ralph Waldo Emerson (1803–1882)
“The universe is then one, infinite, immobile.... It is not capable of comprehension and therefore is endless and limitless, and to that extent infinite and indeterminable, and consequently immobile.”
—Giordano Bruno (1548–1600)