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
Parents
48
A framework for numeric analysis of array operations
Denis Gopan, Thomas Reps, Mooly Sagiv · 2005 · 158 citations
Discovering properties about arrays in simple programs
Nicolas Halbwachs, Mathias Péron · 2008 · 142 citations · Full text
Best sorting algorithm for nearly sorted lists
Curtis R. Cook, Do Jin Kim · Communications of the ACM · 1980 · 107 citations · Full text
Beth Simon, Tzu-Yi Chen, Gary Lewandowski et al. · 2006 · 79 citations
1–5 of 48
115
2
h-index
2
h-index
2
h-index
2
h-index
National Institute of Astrophysics, Optics and Electronics, Mexico
2 publications · 48 citations
2
h-index
1–5 of 115
72

Centre National de la Recherche Scientifique
Paris, France
3 h-index
6 publications
446 citations
Verimag
Gières, France
2 h-index
4 publications
368 citations
Rhode Island College
Providence, United States
2 h-index
2 publications
104 citations

Lovely Professional University
Phagwāra, India
2 h-index
4 publications
62 citations
University of California San Diego
San Diego, United States
2 h-index
2 publications
104 citations

Xavier University
Cincinnati, United States
2 h-index
2 publications
104 citations

National Institute of Astrophysics, Optics and Electronics
Puebla City, Mexico
2 h-index
8 publications
192 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
2 publications
202 citations
1–8 of 72
3 publications · 43 citations
3
h-index
2 publications · 69 citations
2
h-index
Repository · 2 publications · 46 citations
2
h-index
FGCS · 2 publications · 46 citations
2
h-index
2 publications · 86 citations
2
h-index
1–5