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 think of the nestling fallen into the deep grass,
The turtle gasping in the dusty rubble of the highway,
The paralytic stunned in the tub, and the water rising,—
All things innocent, hapless, forsaken.”
—Theodore Roethke (1908–1963)
“That man’s best works should be such bungling imitations of Nature’s infinite perfection, matters not much; but that he should make himself an imitation, this is the fact which Nature moans over, and deprecates beseechingly. Be spontaneous, be truthful, be free, and thus be individuals! is the song she sings through warbling birds, and whispering pines, and roaring waves, and screeching winds.”
—Lydia M. Child (1802–1880)