CareerCup

Thanks for posting the question. It was very useful

Local variables that aren't dynamically allocated (malloc/calloc) are placed on the stack. Stack is a LIFO (last-in-first-out) structure, so when you enter a new function the local variables are pushed onto the stack. If you keep going, deeper and deeper into nested functions you will fill up the stack and overflow.

Didn't understand the question. Could you please elaborate.

I think the question is to explain what stack overflow is and to show an example instance.

indefinite loop? was it a copy constructor passed as a "pass by value"?

int foo() {
return foo();
}
causes stack overflow....