2003Unpublished venueRequires access

Two Idears and Forms of the Algorithm "Divide and Conquer

Haiyuan Wang

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Divide and conquer algorithms, Algorithm, Ideal (ethics), Computer science, Process (computing), Mathematics, Theoretical computer science, Operating system

Related papers

Back to paper searchBrowse research topicsOriginal source
Two Idears and Forms of the Algorithm "Divide and Conquer — Research Paper | ScholarLens