merge sort


Also found in: Dictionary, Thesaurus, Medical, Legal, Wikipedia.
Related to merge sort: Bubble sort, Insertion sort, Quick sort

merge sort

[′mərj ‚sȯrt]
(computer science)
To produce a single sequence of items ordered according to some rule, from two or more previously ordered or unordered sequences, without changing the items in size, structure, or total number; although more than one pass may be required for a complete sort, items are selected during each pass on the basis of the entire key.

merge sort

A sorting technique that sequences data by continuously merging items in the list. Every single item in the original unordered list is merged with another, creating groups of two. Every two-item group is merged, creating groups of four and so on until there is one ordered list. See sort algorithm and merge.
References in periodicals archive ?
For example, Figure 2 shows the solved example of a merge sort where there is no word indicating that it is an example.
Also, for ruling out cases like recursion tree for merge sort (see Figure 5), only those slides in which the count on numerals is more than a threshold [beta] are considered.
The upper bounds can be obtained by a variant of merge sort with P-block lookahead forecasting and by a distribution-sorting algorithm that uses a median finding subroutine.