Divide-and-conquer algorithms divides a problem into multiple non-overlapping subproblems to construct a solution.

Typically only top-down and recursive.

Subproblems constructed by partitioning the current problem, then the subproblems are solved and joined together somehow.

Examples: quicksort, merge sort.