Editing Divide-and-conquer algorithm (section)

=== Explicit stack ===
Divide-and-conquer algorithms can also be implemented by a non-recursive program that stores the partial sub-problems in some explicit data structure, such as a [[stack (data structure)|stack]], [[queue (data structure)|queue]], or [[priority queue]].  This approach allows more freedom in the choice of the sub-problem that is to be solved next, a feature that is important in some applications — e.g. in [[breadth first recursion|breadth-first recursion]] and the [[branch-and-bound]] method for function optimization. This approach is also the standard solution in programming languages that do not provide support for recursive procedures.