(algorithmic technique)
Definition: A variant of divide and conquer in which subproblems created in the "divide" step are merged before the "conquer" step.
Note: From Algorithms and Theory of Computation Handbook, page 19-26, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
Author: CRC-A
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:03:41 2004.
HTML page formatted Fri Dec 30 11:16:41 2005.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "divide and marriage before conquest", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/dividemarrig.html
