Understanding divide and conquer algorithms

In computer science, divide-and-conquer is an algorithmic paradigm that recursively breaks a larger problem into smaller subproblems of the same type until they are small enough to be solved directly. These smaller problems are solved, and their solutions are combined to formulate the solution to the original problem. It follows three phases:

• Divide: Divide the bigger problem into smaller subproblems.
• Apply: Solve the smaller subproblems.
• Combine: Combine the solutions from the smaller subproblems to create the bigger solution.

Example