April 2018
Beginner to intermediate
426 pages
10h 19m
English
In Chapter 13, Sorting and Searching Algorithms, we learned how to develop the merge and quick sort algorithms. What both sorting solutions have in common is that they are divide and conquer algorithms. Divide and conquer is one of the approaches to algorithm design. It breaks the problem into small subproblems that are similar to the original problem, it solves the subproblems recursively, and combines the solutions of the subproblems to solve the original problem.
The divide and conquer algorithm can be split into three parts: