Stack Overflow

A stack overflow error occurs when a program attempts to use more memory space than is available on the call stack. This typically happens due to:

• Excessive recursion without a proper base case
• Very large local arrays or structs
• Deep or infinite function call chains

Example of a function that may cause stack overflow:

1void infinite_recursion() {
2  // Recursive call with no base case
3  infinite_recursion();
4}

To prevent stack overflow:

1. Ensure recursive functions have a well-defined base case that stops recursion.
2. Avoid allocating large arrays or structs on the stack. Consider using dynamic allocation on the heap instead.
3. Optimize function call chains to reduce stack usage.
4. Increase stack size if necessary (not always possible).

Example of proper recursion with a base case:

1void countdown(int n) {
2  if (n == 0) {// Base case
3    std::cout << "Countdown finished!\n";
4    return;
5  }
6  std::cout << n << '\n';
7  countdown(n - 1); // Recursive call
8}

By understanding the limitations of the stack and employing good programming practices, you can avoid stack overflow errors in your C++ programs.