Insertion Sort

Insertion Sort is a comparison-based sorting algorithm that builds the final sorted array one element at a time by iteratively inserting each new element into its correct position within the already sorted portion of the list.

48

Publications

1.7K

Citations

115

Authors

72

Institutions

Publications per year

2017–2026

11

Authors

115

  1. NH
    Nicolas Halbwachs

    Verimag, France

    2 publications · 184 citations

    2

    h-index

  2. RM
    Robert McCartney

    University of Connecticut, United States

    2 publications · 104 citations

    2

    h-index

  3. KS
    Kate Sanders

    Rhode Island College, United States

    2 publications · 104 citations

    2

    h-index

  4. TR
    Thomas Reps

    University of Wisconsin–Madison, United States

    2 publications · 202 citations

    2

    h-index

  5. FM
    Fernando Martin Del Campo

    National Institute of Astrophysics, Optics and Electronics, Mexico

    2 publications · 48 citations

    2

    h-index

1–5 of 115

Venues

  1. 3

    h-index

  2. IEEE Software

    2 publications · 69 citations

    2

    h-index

  3. SSRN Electronic Journal

    Repository · 2 publications · 46 citations

    2

    h-index

  4. Future Generation Computer Systems

    FGCS · 2 publications · 46 citations

    2

    h-index

  5. ACM SIGPLAN Notices

    2 publications · 86 citations

    2

    h-index

1–5