The ideia is to prevent a stack overflow in a recursive function. I already search the web, it seems that there's no direct way to find out, or that it depends on compiler or OS. Also read in a magazine that a way to prevent stack overflow was to use a counter variable to stop the recursive function before counter reach 'n' value. Personaly, dont think this woul be a very effective way. I would like to ear your opinions. Thank you.
Bookmarks