Merge Sort
Merge Sort is a divide-and-conquer sorting algorithm that recursively partitions an unsorted list into smaller sublists until each sublist contains a single element, then systematically merges these sublists in a manner that produces a fully sorted list, distinguishing itself by its guaranteed O(n log n) time complexity and stable merging process.
129
Publications
7.4K
Citations
319
Authors
158
Institutions
Publications per year
2017–2026
29
Parents
129
The input/output complexity of sorting and related problems
Alok Aggarwal · Communications of the ACM · 1988 · 1.2K citations · Full text
Richard Cole · SIAM Journal on Computing · 1988 · 734 citations
Richard Cole · 1986 · 363 citations
1–5 of 129
319
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 319
158
Tokyo Institute of Technology
Tokyo, Japan
4 h-index
11 publications
352 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
4 h-index
12 publications
708 citations
University of Southern California
Los Angeles, United States
3 h-index
9 publications
221 citations

Silesian University of Technology
Gliwice, Poland
3 h-index
6 publications
121 citations

Washington University in St. Louis
St Louis, United States
3 h-index
8 publications
195 citations

Imperial College London
London, United Kingdom
3 h-index
5 publications
148 citations
New York University
New York, United States
3 h-index
3 publications
1.1K citations
Nvidia (United Kingdom)
Reading, United Kingdom
2 h-index
4 publications
1.3K citations
1–8 of 158
6 publications · 1.4K citations
6
h-index
4 publications · 814 citations
4
h-index
4 publications · 117 citations
4
h-index
3 publications · 42 citations
3
h-index
3 publications · 126 citations
3
h-index
1–5