Editing Divide-and-conquer algorithm (section)

=== Dynamic programming for overlapping subproblems ===
For some problems, the branched recursion may end up evaluating the same sub-problem many times over.  In such cases it may be worth identifying and saving the solutions to these overlapping subproblems, a technique which is commonly known as [[memoization]].  Followed to the limit, it leads to [[bottom-up design|bottom-up]] divide-and-conquer algorithms such as [[dynamic programming]].