Divide, Combine, and Conquer

AbstractThis chapter is the first of three dealing with well-known design strategies. The strategy dealt with in this chapter, divide and conquer (or simply D&C), is based on decomposing your problem in a way that improves performance. You divide the problem instance, solve subproblems recursively, combine the results, and thereby conquer the problem—a pattern that is reflected in the chapter title.1 KeywordsConvex HullLinear TimeSearch TreeBinary SearchRecursive CallThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.