(algorithmic technique)
Definition: A recursive algorithm, especially a sort algorithm, where dividing (splitting) into smaller problems is time consuming or complex and combining (merging) the solutions is quick or trivial.
Generalization (I am a kind of ...)
divide and conquer.
Aggregate parent (I am a part of or used in ...)
radix sort, quicksort, bucket sort, selection sort.
See also easy split, hard merge.
Note: Although the notion is wide spread, I first heard this term from Doug Edwards about 1994.
Called "Conquer form" of using divide and conquer in [ATCH99, page 3-3].
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 27 October 2005.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Paul E. Black, "hard split, easy merge", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 27 October 2005. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/hardSplitEasyMerge.html
