出典:Wiktionary
出典:『Wiktionary』 (2012/07/10 09:08 UTC 版)
出典:『Wiktionary』 (2015/09/18 18:39 UTC 版)
出典:『Wiktionary』 (2026/07/16 23:12 UTC 版)
mergesort (plural mergesorts)
mergesort (third-person singular simple present mergesorts, present participle mergesorting, simple past and past participle mergesorted)
出典:Wikipedia
出典:『Wikipedia』 (2011/05/30 14:56 UTC 版)
Merge sort is an O(n log n) comparison-based sorting algorithm. Most implementations produce a stable sort, meaning that the implementation preserves the input order of equal elements in the sorted output. It is a divide and conquer algorithm. Merge sort 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.