Search results
We did not find results for: define divide and conquer algorithm.
Check spelling or type a new query.
Yahoo Web Search
- Divide-and-conquer algorithm
Algorithm design paradigm based on multi-branched recursion
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. Wikipedia
