Two Idears and Forms of the Algorithm "Divide and Conquer
Haiyuan Wang
Abstract
Haiyuan Wang
Abstract
The algorithm and conquer is one of the frequently used method. On this algorithm the divide process is used, a problem is solved by solving the smaller size cognate problems. Two forms of the algorithm and conquer are in-troduced; their ideal differences, features and application situations are analyzed and discussed.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The algorithm and conquer is one of the frequently used method. On this algorithm the divide process is used, a problem is solved by solving the smaller size cognate problems. Two forms of the algorithm and conquer are in-troduced; their ideal differences, features and application situations are analyzed and discussed.
Key concepts: Divide and conquer algorithms, Algorithm, Ideal (ethics), Computer science, Process (computing), Mathematics, Theoretical computer science, Operating system