Divide and conquer
From PEGWiki
A divide-and-conquer algorithm works by recursively splitting a problem into smaller sub-problems until each problem can be directly solved.
- This page was last modified on 2 January 2010, at 04:26.
- Content is available under Attribution 3.0 Unported unless otherwise noted.
