Recursion and stack overflow

[Leroy1981]

I have a function that calls itself several times before finishing. This function needs to call itself thousands of
times but i the stack isn't big enough so i get a stack overflow error. I know it's possible to increase the stack size but i want to find another solution. the purpose of the function is to fill in part of a picture like the paint can tool in mspaint so if anyone knows another way to accomplish this it would be really helpful.

 

[Cagliostro]

Instead of recursion often are used multiple (not nested) applied loops on the same saved data

Ion Filipski

 

[bNasty]

If you are using fill-algorithm, consider something more efficient.
My advice : A* without heuristics. The fastest possible and no recursion!

 

[LastCyborg]

if the problem are the stacks you sholud try using a type shorter, try using the minimum size required.

I suggest to use the stack library
and dlecra the stacks something like this
#include <stack.h>
typedef stack <int> S

S your_stack_name;
your_stack_name.push(any_integer_identifier);
your_stack_name.pop();

etc



--- LastCyborg ---