Divide-and-conquer algorithm: Difference between revisions

Revision as of 10:39, 28 January 2021

Revision as of 01:06, 2 March 2021

Line 1:

{{shortShort description|Algorithms which recursively solve subproblems}}

In [[computer science]], '''divide and conquer''' is an [[algorithm design paradigm]]. A divide-and-conquer [[algorithm]] recursively breaks down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem.

Line 82:

== See also ==

{{commonsCommons category|Divide-and-conquer algorithms}}

* [[Akra–Bazzi method]]

* [[Decomposable aggregation function]]

Line 92:

== References ==

<references/>{{Reflist}}{{Data structures and algorithms}}

{{Authority control}}

{{DEFAULTSORT:Divide And Conquer Algorithm}}

[[Category:Divide-and-conquer algorithms| ]]