Divide and Conquer

Problems that can be solved by combining optimal solutions to non-overlapping sub-problems.

As the sub-problems are non-overlapping, Divide-and-conquer algorithms are more trivially parallelizable.