File:Merge-sort-example-300px.gif · Wikimedia Commons · See Wikimedia Commons
مرتبسازی ادغامی
Sign in to saveAlso known as mergesort, MergeSort
worst-case optimal stable divide and conquer comparison sorting algorithm
Key facts
- Class
- Sorting algorithm
- Data structure
- Array
- Worst case performance
- O ( n log n ) {\displaystyle O(n\log n)}
- Best case performance
- Ω ( n log n ) {\displaystyle \Omega (n\log n)} typical, Ω ( n ) {\displaystyle \Omega (n)} natural variant
- Average performance
- Θ ( n log n ) {\displaystyle \Theta (n\log n)}
- Worst case space complexity
- O ( n ) {\displaystyle O(n)} total with O ( n ) {\displaystyle O(n)} auxiliary, O ( 1 ) {\displaystyle O(1)} auxiliary with linked lists
via Wikipedia infobox
Wikidata facts
- Instance of
- divide-and-conquer algorithm
- Subclass of
- sorting algorithm
- Image
- Merge sort algorithm diagram.svg
Show 7 more facts
- discoverer or inventor
- John von Neumann
- Stack Exchange tag
- stackoverflow.com/tags/mergesort
- uses
- merge algorithm
- Commons category
- Merge sort
- derivative work
- Timsort
- time of discovery or invention
- 1945-00-00
- maintained by WikiProject
- WikiProject Mathematics
via Wikidata · CC0