Divide-and-conquer algorithm

Divide-and-conquer algorithm

Uncommon

Rarity: Uncommon

A topic a little better known than average, read and translated beyond its own country.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Invention
Domain
Science and technology
Knowledge cost
4
In collections
Nobody has pulled it yet.

What Wikipedia says

In computer science, divide and conquer, originally a political maxim, designates 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.

Excerpt from the Wikipedia article “Divide-and-conquer algorithm”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Divide-and-conquer algorithm to your collection.

Play for free

Related cards