Mergesort

Mergesort is a comparison-based sorting algorithm that recursively divides an input array into two halves, sorts each half, and then merges the sorted halves to produce a fully sorted output.

Publications

1.5K

Citations

102

Authors

Institutions

Publications per year

2017–2026

Parents

Parallel SortingSorting Algorithms

Publications

FPGASort

Dirk Koch, Jim Tørresen · 2011 · 168 citations

Engineering, Computer Engineering, Computer Science +17

Best sorting algorithm for nearly sorted lists

Curtis R. Cook, Do Jin Kim · Communications of the ACM · 1980 · 107 citations · Full text

Computing, Computer Science, Algorithms +11

Simple randomized mergesort on parallel disks

Rakesh Barve, Edward F. Grove, Jeffrey Scott Vitter · Parallel Computing · 1997 · 95 citations · Full text

Computing, Computer Engineering, Computer Science +15

Practical in-place merging

Bing-Chao Huang, Michael A. Langston · Communications of the ACM · 1988 · 62 citations · Full text

Computing, Computer Science, Algorithms +14

On the limits of cache-obliviousness

Gerth Stølting Brodal, Rolf Fagerberg · 2003 · 61 citations

Computing, Computer Engineering, Computer Science +15

1–5 of 50

Authors

102

PL
Per-Åke Larson
University of Waterloo, Canada
5 publications · 167 citations
5
h-index
JS
Jeffrey Scott Vitter
Duke University, United States
3 publications · 120 citations
3
h-index
RB
Rakesh Barve
Duke University, United States
3 publications · 120 citations
3
h-index
MA
Muhammad Al-Hashimi
King Abdulaziz University, Saudi Arabia
2 publications · 21 citations
2
h-index
WZ
Weiye Zhang
Beijing Forestry University, China
2 publications · 69 citations
2
h-index

1–5 of 102

Institutions

1–8 of 66

Venues

Communications of the ACM
3 publications · 182 citations
3
h-index
IEEE Transactions on Computers
3 publications · 53 citations
3
h-index
Procedia Computer Science
2 publications · 26 citations
2
h-index
IEEE Access
2 publications · 21 citations
2
h-index
Algorithmica
2 publications · 36 citations
2
h-index

1–5