All recursion can be translated into a loop and a stack. In the tail recursive case you don’t even need a stack, a loop would suffice. That means all divide an

All recursion can be translated into a loop and a stack. In the tail recursive case you don’t even need a stack, a loop would suffice. That means all divide and conquer algorithms can be implemented without recursion.