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)
“It was a time of madness, the sort of mad-hysteria that always presages war. There seems to be nothing left but war—when any population in any sort of a nation gets violently angry, civilization falls down and religion forsakes its hold on the consciences of human kind in such times of public madness.”
—Rebecca Latimer Felton (1835–1930)