merge sort

worst-case optimal stable divide and conquer comparison sorting algorithm
Class type of: sorting algorithm Q189057

Facts

12 properties
Average time complexity
O(n \log n)
Best-case space complexity
O(1)
Best-case time complexity
O(n \log n)
Derivative work
Timsort[10]
Discoverer or inventor
John von Neumann[3]
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
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

Report an error or request removal Lineage (PROV-JSON)

🔗 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

Summary

merge sort is a comparison sort[1]. It is a type of sorting algorithm[2].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). merge sort. Retrieved November 14, 2026, from https://4ort.xyz/entity/merge-sort
MLA “merge sort.” 4ort.xyz Knowledge Graph, 4ort.xyz, 14 Nov. 2026, https://4ort.xyz/entity/merge-sort.
BibTeX @misc{4ortxyz_merge-sort_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{merge sort}}, year = {2026}, url = {https://4ort.xyz/entity/merge-sort}, note = {Accessed: 2026-11-14}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): merge sort — https://4ort.xyz/entity/merge-sort (retrieved 2026-11-14)

Canonical URL: https://4ort.xyz/entity/merge-sort · Last refreshed:

Edit History

Rolling log of changes to this entity's Wikidata record. Values shown reflect the current state of each edited property — follow the history link to see the precise diff for any edit.

  1. 18w ago · Nyuhn · 2026-07-10 view diff on Wikidata ↗
    Discoverer or inventor → John von Neumann
    Maintained by WikiProject → WikiProject Mathematics
    Derivative work → Timsort
    Uses → array data structure, merge algorithm
    + 4 other properties edited (see Wikidata diff for full list)
    "Changed the item: QuickStatements 3.0 batch #40849: ZGBK ID"
Live feed via Wikidata EventStreams. New edits appear within minutes of being made on Wikidata.