Insertion sort (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Insertion sort" in English language version.

Last modified: 07:11:23, 22 September 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

41books.google.com

3^rd place

41worldcat.org

4^th place

33doi.org

2^nd place

22semanticscholar.org

15^th place

8^th place

11archive.org

6^th place

11stackoverflow.com

9,249^th place

6,951^st place

11docs.google.com

877^th place

850^th place

11arxiv.org

49^th place

31^st place

11ams.org

434^th place

249^th place

11web.archive.org

1^st place

11vcsu.edu

low place

ams.org (Global: 434^th place; English: 249^th place)

mathscinet.ams.org

Bender, Michael A.; Farach-Colton, Martín; Mosteiro, Miguel A. (2006). "Insertion sort is O(n log n)". Theory of Computing Systems. 39 (3): 391–397. arXiv:cs/0407003. doi:10.1007/s00224-005-1237-z. MR 2218409. S2CID 14701669.

archive.org (Global: 6^th place; English: 6^th place)

Sedgewick, Robert (1983). Algorithms. Addison-Wesley. p. 95. ISBN 978-0-201-06672-2.

arxiv.org (Global: 49^th place; English: 31^st place)

Bender, Michael A.; Farach-Colton, Martín; Mosteiro, Miguel A. (2006). "Insertion sort is O(n log n)". Theory of Computing Systems. 39 (3): 391–397. arXiv:cs/0407003. doi:10.1007/s00224-005-1237-z. MR 2218409. S2CID 14701669.

books.google.com (Global: 3^rd place; English: 3^rd place)

Bentley, Jon (2000). "Column 11: Sorting". Programming Pearls (2nd ed.). ACM Press / Addison-Wesley. pp. 115–116. ISBN 978-0-201-65788-3. OCLC 1047840657.

docs.google.com (Global: 877^th place; English: 850^th place)

"Binary Merge Sort"

doi.org (Global: 2^nd place; English: 2^nd place)

Frank, R. M.; Lazarus, R. B. (1960). "A High-Speed Sorting Procedure". Communications of the ACM. 3 (1): 20–22. doi:10.1145/366947.366957. S2CID 34066017.
Sedgewick, Robert (1986). "A New Upper Bound for Shellsort". Journal of Algorithms. 7 (2): 159–173. doi:10.1016/0196-6774(86)90001-5.
Bender, Michael A.; Farach-Colton, Martín; Mosteiro, Miguel A. (2006). "Insertion sort is O(n log n)". Theory of Computing Systems. 39 (3): 391–397. arXiv:cs/0407003. doi:10.1007/s00224-005-1237-z. MR 2218409. S2CID 14701669.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Frank, R. M.; Lazarus, R. B. (1960). "A High-Speed Sorting Procedure". Communications of the ACM. 3 (1): 20–22. doi:10.1145/366947.366957. S2CID 34066017.
Bender, Michael A.; Farach-Colton, Martín; Mosteiro, Miguel A. (2006). "Insertion sort is O(n log n)". Theory of Computing Systems. 39 (3): 391–397. arXiv:cs/0407003. doi:10.1007/s00224-005-1237-z. MR 2218409. S2CID 14701669.

stackoverflow.com (Global: 9,249^th place; English: 6,951^st place)

Schwarz, Keith. "Why is insertion sort Θ(n^2) in the average case? (answer by "templatetypedef")". Stack Overflow.

vcsu.edu (Global: low place; English: low place)

euler.vcsu.edu

Hill, Curt (ed.), "Trailing Pointer Technique", Euler, Valley City State University, archived from the original on 26 April 2012, retrieved 22 September 2012.

web.archive.org (Global: 1^st place; English: 1^st place)

Hill, Curt (ed.), "Trailing Pointer Technique", Euler, Valley City State University, archived from the original on 26 April 2012, retrieved 22 September 2012.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Bentley, Jon (2000). "Column 11: Sorting". Programming Pearls (2nd ed.). ACM Press / Addison-Wesley. pp. 115–116. ISBN 978-0-201-65788-3. OCLC 1047840657.

Insertion sort (English Wikipedia)

ams.org (Global: 434th place; English: 249th place)

mathscinet.ams.org

archive.org (Global: 6th place; English: 6th place)

arxiv.org (Global: 49th place; English: 31st place)

books.google.com (Global: 3rd place; English: 3rd place)

docs.google.com (Global: 877th place; English: 850th place)

doi.org (Global: 2nd place; English: 2nd place)

semanticscholar.org (Global: 15th place; English: 8th place)