Merge sort
Divide and conquer sorting algorithm
Merge sort
Merge sort (also commonly spelled as mergesort or merge-sort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations of merge sort are stable, which means that the relative order of equal elements is the same between the input and output. Merge sort is a divide-and-conquer algorithm that was invented by John von Neumann in 1945. A detailed description and analysis of bottom-up merge sort appeared in a report by Goldstine and von Neumann as early as 1948.
Read on Wikipedia · Image Swfung8, CC BY-SA 3.0
Open boosters, collect cards and trade them. Free to play.
Play for free