Python Data Structures and Algorithms

Merge

To obtain the final solution, we need to combine the smaller solutions to the smaller problems in order to solve the bigger problem.

There are other variants to the divide and conquer algorithm, such as merge and combine, and conquer and solve.

Algorithms that make use of the divide and conquer principle include merge sorting, quick sort, and Strassen's matrix multiplication. We will go through an implementation of the merge sort as we started earlier in Chapter 3, Principles of Algorithm Design.