merge sort
0 sources
merge sort
Summary
merge sort is a comparison sort[1]. It draws 662 Wikipedia views per month (comparison_sort category, ranking #2 of 2).[2]
Key Facts
- merge sort is credited with the discovery of John von Neumann[3].
- merge sort's image is recorded as Merge-sort-example-300px.gif[4].
- merge sort's image is recorded as Merge sort algorithm diagram.svg[5].
- merge sort's instance of is recorded as comparison sort[6].
- merge sort's instance of is recorded as stable sorting algorithm[7].
- merge sort's instance of is recorded as divide-and-conquer algorithm[8].
- merge sort's subclass of is recorded as sorting algorithm[9].
- merge sort's Commons category is recorded as Merge sort[10].
- merge sort's time of discovery or invention is recorded as +1945-00-00T00:00:00Z[11].
- merge sort's Freebase ID is recorded as /m/050_s[12].
- merge sort's Stack Exchange tag is recorded as https://stackoverflow.com/tags/mergesort[13].
- merge sort's has characteristic is recorded as asymptotically optimal algorithm[14].
- merge sort's uses is recorded as array data structure[15].
- merge sort's uses is recorded as merge algorithm[16].
- merge sort's MathWorld ID is recorded as MergeSort[17].
- merge sort's Quora topic ID is recorded as Merge-Sort[18].
- merge sort's worst-case time complexity is recorded as O (n \log n)[19].
- merge sort's best-case time complexity is recorded as O(n \log n)[20].
- merge sort's average time complexity is recorded as O(n \log n)[21].
- merge sort's worst-case space complexity is recorded as O(n)[22].
- merge sort's best-case space complexity is recorded as O(1)[23].
- merge sort's derivative work is recorded as Timsort[24].
- merge sort's Rosetta Code page ID is recorded as Sorting_algorithms/Merge_sort[25].
- merge sort's Dictionary of Algorithms and Data Structures ID is recorded as mergesort[26].
- merge sort's Dictionary of Algorithms and Data Structures ID is recorded as mergesortI[27].
Body
Designation and Status
Recorded instance of include comparison sort[6], stable sorting algorithm[7], and divide-and-conquer algorithm[8].
Why It Matters
merge sort draws 662 Wikipedia views per month (comparison_sort category, ranking #2 of 2).[2] It has Wikipedia articles in 29 language editions, a strong signal of global cultural recognition.[28] It is known by 26 alternative names across languages and contexts.[29]