Recursion-related problem

[kelvSYC]

I have a method that says something like this:

void foo(int b) {
// Do stuff and calculate the value of condition and anotherInt
if (condition) {
foo(anotherInt);
}
}

How can I change foo so that the inner foo is called only when the
outer foo is completed (ie. only one foo method is running)?

 

[Michael Borgwardt]

void foo(int b) {
// Do stuff and calculate the value of condition and anotherInt
if (condition) {
foo(anotherInt);
}
}

How can I change foo so that the inner foo is called only when the
outer foo is completed (ie. only one foo method is running)?

By elimination the recursion. How that can be done (and whether it can be done
at all) depends on the algorithm in question.

Basically, you need to replace the recursion with a loop, initialize the data
beforehand and then run the loop until the termination condition is met.

 

[Eric Sosman]

I have a method that says something like this:

void foo(int b) {
// Do stuff and calculate the value of condition and anotherInt
if (condition) {
foo(anotherInt);
}
}

How can I change foo so that the inner foo is called only when the
outer foo is completed (ie. only one foo method is running)?

void foo(int b) {
do {
// Do stuff and calculate the value of condition and anotherInt
b = anotherInt;
} while (! condition);
}