Adaptive Sorting

Adaptive Sorting is a sorting algorithm that belongs to the class of comparison-based sorting methods and is distinguished by its ability to exploit existing order in the input data to reduce the number of comparisons and time complexity for nearly-sorted sequences.

44

Publications

1.8K

Citations

117

Authors

69

Institutions

Publications per year

2017–2026

12

Authors

117

  1. OP
    Ola Petersson

    Lund University, Sweden

    6 publications · 160 citations

    6

    h-index

  2. AM
    Alistair Moffat

    The University of Melbourne, Australia

    4 publications · 97 citations

    4

    h-index

  3. XL
    Xiaoming Li

    Peking University, China

    2 publications · 98 citations

    2

    h-index

  4. IM
    Ian Mangion

    Merck & Co., Inc., Rahway, NJ, USA (United States), United States

    2 publications · 186 citations

    2

    h-index

  5. GZ
    Gabriel Zachmann

    University of Bonn, Germany

    2 publications · 144 citations

    2

    h-index

1–5 of 117

Venues

  1. Information Processing Letters

    2 publications · 37 citations

    2

    h-index

  2. Theoretical Computer Science

    2 publications · 67 citations

    2

    h-index

  3. SIAM Journal on Computing

    2 publications · 147 citations

    2

    h-index

  4. Software Practice and Experience

    2 publications · 39 citations

    2

    h-index

  5. Discrete Applied Mathematics

    1 publications · 34 citations

    1

    h-index

1–5