Divide-and-conquer algorithm
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.
Wikipage disambiguates
Decrease and conquerDecrease and conquer algorithmDecrease and conquer algorithmsDivide-and-Conquer algorithmDivide-and-conquer methodDivide & conquer algorithmDivide and conquer (algorithm)Divide and conquer (computer science)Divide and conquer algorithmDivide and conquer algorithmsDivide and conquer approachDivide and conquer methodDivide and conquer paradigmDivide and marriage before conquest
Wikipage redirect
Aggregate functionAkra–Bazzi methodAlgorithmAlgorithmic PuzzlesAlgorithmic paradigmAlgorithmic techniqueAlgorithmicsAnatoly KaratsubaArt gallery problemB+ treeBREACHBeam stack searchBinary logarithmBinary splittingBisection (software engineering)Boolean satisfiability problemC3 linearizationCRIMECache-oblivious algorithmCollective operationComputational complexity of matrix multiplicationCooley–Tukey FFT algorithmCorrelation attackD&CData stream clusteringDebuggingDecrease and conquerDecrease and conquer algorithmDecrease and conquer algorithmsDelaunay triangulationDichotomic searchDiffie–Hellman key exchangeDijkstra–Scholten algorithmDiscrepancy of hypergraphsDiscrepancy theoryDivide-and-Conquer algorithmDivide-and-conquer eigenvalue algorithmDivide-and-conquer methodDivide & conquer algorithmDivide and conquer
Link from a Wikipage to another Wikipage
primaryTopic
Divide-and-conquer algorithm
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.
has abstract
Das Teile-und-herrsche-Verfahr ...... in Such- und Sortierverfahren.
@de
Di dalam ilmu komputer, algori ...... ebih mudah untuk diselesaikan.
@in
Divide et impera (in italiano ...... ne di problemi computazionali.
@it
Divisão e Conquista (do inglês ...... 960 no algoritmo de Karatsuba.
@pt
En informatique, diviser pour ...... sformation de Fourier rapide).
@fr
En la cultura popular, divide ...... ndo relaciones de recurrencia.
@es
En la cultura popular, dividei ...... lent relacions de recurrència.
@ca
In computer science, divide an ...... solving recurrence relations.
@en
Informatikan, Zatitu eta iraba ...... behar ditu ordenaketa egiteko.
@eu
Metoda rozděl a panuj (latinsk ...... mace nebo binární vyhledávání.
@cs
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,017,328,937
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
type
comment
Das Teile-und-herrsche-Verfahr ...... in Such- und Sortierverfahren.
@de
Di dalam ilmu komputer, algori ...... ebih mudah untuk diselesaikan.
@in
Divide et impera (in italiano ...... ne di problemi computazionali.
@it
Divisão e Conquista (do inglês ...... 960 no algoritmo de Karatsuba.
@pt
En informatique, diviser pour ...... solutions des sous-problèmes.
@fr
En la cultura popular, divide ...... nsformada discreta de Fourier.
@es
En la cultura popular, dividei ...... lent relacions de recurrència.
@ca
In computer science, divide an ...... ution to the original problem.
@en
Informatikan, Zatitu eta iraba ...... sarreraren emaitza lortzen du.
@eu
Metoda rozděl a panuj (latinsk ...... vanou dynamické programování).
@cs
label
Algorisme divideix i venceràs
@ca
Algoritmo divide y vencerás
@es
Divide and Conquer
@in
Divide et impera (informatica)
@it
Divide-and-conquer algorithm
@en
Diviser pour régner (informatique)
@fr
Divisão e conquista
@pt
Dziel i zwyciężaj
@pl
Rozděl a panuj (algoritmus)
@cs
Teile-und-herrsche-Verfahren
@de