君主和殖民者们所成功运用的分而治之策略也可以运用到高效率的计算机算法的设计过程中。本章将首先介绍怎样在算法设计领域应用这一古老的策略，然后将利用这一策略解决如下问题：最小最大问题、矩阵乘法、残缺棋盘、排序、选择和一个计算几何问题——找出二维空间中距离最近的两个点。

本章给出了用来分析分而治之算法复杂性的数学方法，并通过推导最小最大问题和排序问题的复杂性下限来证明分而治-monarchy and colonialists who have successfully used the divide and conquer strategy can also be used in high-efficiency computer algorithm design process. This chapter will begin with an introduction in how the algorithm design of the application of this ancient strategy, and then use this strategy to solve the following problems : minimum biggest problem, matrix multiplication, incomplete chessboard, sorting, selection, and a computational geometry problems-- two-dimensional space to find the nearest two points. This chapter is given to analysis of divide and conquer algorithm complexity of the mathematical methods and derived through the largest and the smallest order of the complexity threshold to prove divide and rule