4. Divide and Conquer
Learning Objectives
By the end of this chapter, you will be able to:
- Describe the divide-and-conquer design paradigm
- Implement standard divide-and-conquer algorithms such as merge sort, quicksort, and linear time selection
- Solve problems using the MapReduce programming model
- Learn how to use a multithreaded C++ MapReduce implementation
In this chapter, we shall study the divide-and-conquer algorithm design paradigm and learn how to use it to solve computational problems.