Insertion sort (English Wikipedia)

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

refsWebsite

Global rank English rank

2^nd place

2^nd place

2semanticscholar.org

11^th place

8^th place

1books.google.com

3^rd place

3^rd place

5^th place

5^th place

6^th place

6^th place

1stackoverflow.com

4,643^rd place

2,973^rd place

1docs.google.com

1,047^th place

1,015^th place

69^th place

59^th place

451^st place

277^th place

1web.archive.org

1^st place

1^st place

low place

low place

ams.org (Global: 451^st place; English: 277^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: 69^th place; English: 59^th 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: 1,047^th place; English: 1,015^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: 11^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: 4,643^rd place; English: 2,973^rd 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: 5^th place; English: 5^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.