Divide and conquer the law

The basic idea of divide-and-conquer method is to decompose a problem of size n into K small sub-problem (preferably the size of sub-problem is roughly the same), these sub-problems are independent of each other and the same as the original problem, and then the solution of each sub-problem is merged into the solution of the original problem.

Divide-and-conquer (P)

{

if (| p| <= n0) adhoc (P);

Divide P into smaller subinstances

P1,p2,p3,p4.......,pk

for (i=1;i<=k;i++)

Yi=divide-and-conquer (Pi)

Return Merge (y1,y2,.... yk)
}

Among them | P| represents the size of the problem p, N0 is the threshold value, indicating that when the size of the problem p is not more than n0, the problem is easy to solve and no further decomposition. Adhoc (P) is a basic sub-algorithm in the Division and treatment method.

Divide and conquer the law