Merge algorithm: Difference between revisions

Revision as of 19:57, 19 December 2020

Revision as of 14:19, 27 June 2021

Line 4:

== Application ==

[[File:Merge sort algorithm diagram.svg|thumb|upright=1.5|An example for merge sort]]

The merge algorithm plays a critical role in the [[merge sort]] algorithm, a [[comparison sort|comparison-based sorting algorithm]]. Conceptually, the merge sort algorithm consists of two steps:

# [[Recursion (computer science)|Recursively]] divide the list into sublists of (roughly) equal length, until each sublist contains only one element, or in the case of iterative (bottom up) merge sort, consider a list of ''n'' elements as ''n'' sub-lists of size 1. A list containing a single element is, by definition, sorted.