Revision as of 22:05, 16 February 2018 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,585 edits →Application: no reason for this image to have such nonstandard formatting ← Previous edit		Revision as of 22:05, 16 February 2018 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,585 edits →Application: avoid stating exactly where to find the image since it varies by platform Next edit →
Line 10: The merge algorithm is used repeatedly in the merge sort algorithm. An example merge sort is given ~~above~~in the illustration. It starts with an unsorted array of 7 integers. The array is divided into 7 partitions; each partition contains 1 element and is sorted. The sorted partitions are then merged to produce larger, sorted, partitions, until 1 partition, the sorted array, is left. == Merging two lists ==

Merge algorithm: Difference between revisions