Editing Divide-and-conquer algorithm (section)

=== Recursion ===
Divide-and-conquer algorithms are naturally implemented as [[Recursion (computer science)|recursive procedures]]. In that case, the partial sub-problems leading to the one currently being solved are automatically stored in the [[call stack|procedure call stack]]. A recursive function is a function that calls itself within its definition.