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

Authors

319

  1. KK
    Kenji Kise

    Tokyo Institute of Technology, Japan

    4 publications · 122 citations

    4

    h-index

  2. PS
    Philip S. Yu

    University of Illinois Chicago, United States

    4 publications · 236 citations

    4

    h-index

  3. TV
    Thiem Van Chu

    Tokyo Institute of Technology, Japan

    3 publications · 108 citations

    3

    h-index

  4. VK
    Viktor K. Prasanna

    University of Southern California, United States

    3 publications · 76 citations

    3

    h-index

  5. RC
    Richard Cole

    New York University, United States

    3 publications · 1.1K citations

    3

    h-index

1–5 of 319

Venues

  1. Communications of the ACM

    6 publications · 1.4K citations

    6

    h-index

  2. SIAM Journal on Computing

    4 publications · 814 citations

    4

    h-index

  3. The Computer Journal

    4 publications · 117 citations

    4

    h-index

  4. Procedia Computer Science

    3 publications · 42 citations

    3

    h-index

  5. Information Processing Letters

    3 publications · 126 citations

    3

    h-index

1–5