merge sort
worst-case optimal stable divide and conquer comparison sorting algorithm
Press Enter · cited answer in seconds
0 sources
merge sort
Summary
merge sort is a comparison sort[1]. It has Wikipedia articles in 29 language editions, a strong signal of global cultural recognition.[2]
Key Facts
- merge sort is credited with the discovery of John von Neumann[3].
- merge sort's instance of is recorded as comparison sort[4].
- merge sort's instance of is recorded as stable sorting algorithm[5].
- merge sort's instance of is recorded as divide-and-conquer algorithm[6].
- merge sort is a type of sorting algorithm[7].
- merge sort's Commons category is recorded as Merge sort[8].
- merge sort's time of discovery or invention is recorded as 1945[9].
- merge sort's Stack Exchange tag is recorded as https://stackoverflow.com/tags/mergesort[10].
- merge sort's has characteristic is recorded as asymptotically optimal algorithm[11].
- merge sort's uses is recorded as array data structure[12].
- merge sort's uses is recorded as merge algorithm[13].
- merge sort's derivative work is recorded as Timsort[14].
- merge sort's maintained by WikiProject is recorded as WikiProject Mathematics[15].
Body
Designation and Status
Recorded instance of include comparison sort[4], stable sorting algorithm[5], and divide-and-conquer algorithm[6].
Why It Matters
merge sort has Wikipedia articles in 29 language editions, a strong signal of global cultural recognition.[2] It is known by 26 alternative names across languages and contexts.[16]