convert Recursion to linear can it be done

Hello all
i have legacy code that preform Recursion calling this Recursion is very heavy and long and sometimes it gives me stack overflow exceptions
i wander in general or algorithmic view can i convert Recursion flow to linear ( not Recursion) ?
Thanks

Depends on your algorithm I guess. You could try to implement a normal loop and using a std::stack to keep whatever state you have (instead of performing the resursive call).

Something like this (semi-pseudo code):

Code:

---

std::stack<MyState> Stack;
Stack.push(InitialState);

while(Stack.length > 0)
{
  CurrentState = Stack.pop();
  //Do something with current state, if recursion is needed call Stack.push(SubState);
}

---

hello and thanks for the reply but i didnt understand this
how can i save state ?
and how can i convert it to my flow .
can you explain me on the classic factorial function
thanks allot