Research on division and conquer algorithm

Abstract

In computer science, divide-and-conquer is an important algorithm. The literal interpretation is "divide-and-conquer," in which a complex problem is divided into two or more identical or similar sub-problems, and then sub-problems are divided into smaller sub-problems, until the final sub-problem can be solved simply and directly. The combination of solutions of the solution of the original problem. This technique is the foundation of many efficient algorithms, such as sort algorithm (fast sort, merge sort), Fourier transform (fast Fourier transform) and so on. When it comes to divide-and-conquer algorithms, it’s necessary to say recursion. They’re like twin brothers, often used in algorithm design at the same time, and As a result, many efficient algorithms are generated. The direct or indirect call of its own algorithm is called a recursive algorithm. The function defined by the function itself is called recursive function. The sub-problem generated by divide-and-conquer method is often the smaller pattern of the original problem, which makes it convenient to use recursive technique. In this case, the repeated application of divide-and-conquer means can make the sub-problem consistent with the original problem type but its scale is constantly reduced, and finally the sub-problem can be reduced to a very easy solution. This naturally leads to recursion.