Merge sort (also commonly spelled mergesort) is an O(n log n) comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted 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 mergesort appeared in a report by Goldstine and Neumann as early as 1948.
Read more about Merge Sort: Algorithm, Natural Merge Sort, Analysis, Use With Tape Drives, Optimizing Merge Sort, Parallel Processing, Comparison With Other Sort Algorithms, Utility in Online Sorting
Famous quotes containing the words merge and/or sort:
“In good company, the individuals merge their egotism into a social soul exactly co-extensive with the several consciousnesses there present.”
—Ralph Waldo Emerson (1803–1882)
“Blind Beggar: How do you know so much about city ordinances?
Inspector Clouseau: What sort of stupid question is that? Are you blind?
Blind Beggar: Yes.”
—Blake Edwards (b. 1922)