Shellsort

Shellsort is a comparison-based sorting algorithm that generalizes insertion sort by allowing the exchange of elements that are far apart, using a sequence of diminishing gaps to progressively reduce the distance between compared elements until a final insertion sort with unit gap completes the ordering.

20

Publications

628

Citations

23

Authors

19

Institutions

Publications per year

2017–2026

0

Authors

23

  1. MT
    Michael T. Goodrich

    Johns Hopkins University, United States

    4 publications · 204 citations

    4

    h-index

  2. RS
    Robert Sedgewick

    Brown University, United States

    3 publications · 97 citations

    3

    h-index

  3. TS
    Torsten Suel

    New York University, United States

    2 publications · 26 citations

    2

    h-index

  4. JI
    Janet Incerpi

    Institut national de recherche en sciences et technologies du numérique, France

    2 publications · 60 citations

    2

    h-index

  5. BP
    Bjorn Poonen

    University of California, Berkeley, United States

    2 publications · 37 citations

    2

    h-index

1–5 of 23

Venues

  1. Journal of Algorithms

    4 publications · 90 citations

    4

    h-index

  2. Journal of the ACM

    JACM · 2 publications · 49 citations

    2

    h-index

  3. Communications of the ACM

    2 publications · 142 citations

    2

    h-index

  4. Information Processing Letters

    2 publications · 38 citations

    2

    h-index

  5. ACM Journal of Experimental Algorithmics

    JEA · 1 publications · 14 citations

    1

    h-index

1–5