merge sort
worst-case optimal stable divide and conquer comparison sorting algorithm
Facts
12 properties- Subclass of
- sorting algorithm
- Average time complexity
- O(n \log n)
- Best-case space complexity
- O(1)
- Best-case time complexity
- O(n \log n)
- Discoverer or inventor
- John von Neumann[3]
- Has characteristic
- asymptotically optimal algorithm[7]
- Time of discovery or invention
- 1945[6]
- Worst-case space complexity
- O(n)
- Worst-case time complexity
- O (n \log n)
🏷️ Also known as
en MergeSort
en mergesort
en merge sort
ar التصنيف الدمجي
ar ترتيب دمجي
ar تصنيف دمجي
cs řazení slučováním
cs merge sort
da flettesortering
de Merge Sort
de Merge-Sort
el ταξινόμηση με συγχώνευση
es ordenacion por fusion
es ordenacion por fusión
es ordenación por fusión
es ordenamiento por fusion
es ordenamiento por fusión
es ordenamiento por mezcla
fa الگوریتم مرتبسازی ادغامی
fa الگوریتم مرتب سازی ادغامی
🔖 Identifiers · 14
- OpenAlex ID
- C35555965
- Image (Wikimedia Commons)
- Merge-sort-example-300px.gif ↗
- Brilliant Wiki ID
- merge
- Dictionary of Algorithms and Data Structures ID
- mergesort, mergesortI
- Encyclopedia of China (Third Edition) ID (2026)
- 3n8iWQ
- Encyclopedia of China (Third Edition) old ID (2021)
- 375957
- Freebase ID
- /m/050_s
- GitHub topic
- merge-sort
- GitLab.com topic ID
- merge-sort, merge-sort-algorithm, merge+sort
- MathWorld ID
- MergeSort
- Microsoft Academic ID (discontinued)
- 35555965
- Quora topic ID
- Merge-Sort
Show all 14 identifiers +2
- Rosetta Code page ID
- Sorting_algorithms/Merge_sort
- Stack Exchange tag
- stackoverflow.com
🔗 Connections
Instance of 3
Uses 2
Derivative work 1
Discoverer or inventor 1
Maintained by WikiProject 1
Subclass of 1
← Based on 1
← Kunstenpunt Knowledge Graph ID 1
Press Enter · cited answer in seconds