Avoiding stackoverflow with recursive algorithms?

Revision en1, by brycesandlund, 2016-09-08 00:41:07

I am wondering what tricks the competitive programming community uses to avoid stack overflow with recursive algorithms. I vaguely remember pulling up someone's code a while back that used a recursive DFS with input size at least 100,000. I also have Steven and Felix Halim's Competitive Programming book and they seem to use recursion without regard to the possibility of stack overflow.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English brycesandlund 2016-09-08 00:41:07 437 Initial revision (published)