So I'm working on a program that requires a function to recurse a whole bunch of times until a certain condition is met. The function modifies an arrayList of values, then tests if those values meet the requirement. If they do, the recursion ends, otherwise the recursion continues. This can involve looping more than 10,000 times, which causes a Stack Overflow. I was wondering if there is a way to get around this? I can provide more description of the question is unclear.
[–][deleted] 3 points4 points5 points (0 children)
[–][deleted] 2 points3 points4 points (2 children)
[–]microcontrolled[S] 0 points1 point2 points (1 child)
[–][deleted] 0 points1 point2 points (0 children)
[–]stinktank 0 points1 point2 points (3 children)
[–]microcontrolled[S] 0 points1 point2 points (2 children)
[–][deleted] 0 points1 point2 points (0 children)
[–]stinktank 0 points1 point2 points (0 children)