# Difference between revisions of "Divide and conquer"

From PEGWiki

(AITTRMeBSYwWBij) |
m (cleared spam, added 1-line summary) |
||

Line 1: | Line 1: | ||

− | + | A divide-and-conquer algorithm works by recursively splitting a problem into smaller sub-problems until each problem can be directly solved. |

## Latest revision as of 04:26, 2 January 2010

A divide-and-conquer algorithm works by recursively splitting a problem into smaller sub-problems until each problem can be directly solved.