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:
“I too but signify at the utmost a little wash’d-up drift,
A few sands and dead leaves to gather,
Gather, and merge myself as part of the sands and drift.”
—Walt Whitman (1819–1892)
“There is a sort of veteran women of condition, who, having lived always in the grand mode, and having possibly had some gallantries, together with the experience of five and twenty or thirty years, form a young fellow better than all the rules that can be given him.”
—Philip Dormer Stanhope, 4th Earl Chesterfield (1694–1773)