Shellsort (English Wikipedia)

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

Last modified: 06:03:20, 25 July 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

1615doi.org

2^nd place

1110semanticscholar.org

15^th place

8^th place

116web.archive.org

1^st place

66arxiv.org

49^th place

31^st place

44psu.edu

299^th place

159^th place

31dtic.mil

934^th place

530^th place

31archive.org

6^th place

31polsl.pl

low place

22cwi.nl

low place

22nyu.edu

1,362^nd place

822^nd place

21ewu.edu

low place

11wcupa.edu

low place

11nist.gov

708^th place

742^nd place

11mathnet.ru

8,689^th place

low place

11inria.fr

6,372^nd place

5,582^nd place

11stackoverflow.com

9,249^th place

6,951^st place

11core.ac.uk

1,383^rd place

954^th place

11hdl.handle.net

66^th place

34^th place

11uib.no

3,363^rd place

3,567^th place

11uu.se

3,445^th place

3,148^th place

11uclibc.org

low place

11github.com

380^th place

337^th place

11nih.gov

5^th place

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

Sedgewick, Robert (1998). Algorithms in C. Vol. 1 (3rd ed.). Addison-Wesley. pp. 273–281. ISBN 978-0-201-31452-6.

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

Lee, Ying Wai (21 December 2021). "Empirically Improved Tokuda Gap Sequence in Shellsort". arXiv:2112.11112 [cs.DS].
Skean, Oscar; Ehrenborg, Richard; Jaromczyk, Jerzy W. (1 January 2023). "Optimization Perspectives on Shellsort". arXiv:2301.00316 [cs.DS].
Lee, Ying Wai (21 December 2021). "Optimal Gap Sequences in Shellsort for $n \leq 16$ Elements". arXiv:2112.11127 [math.CO].
Janson, Svante; Knuth, Donald E. (1997). "Shellsort with Three Increments" (PDF). Random Structures and Algorithms. 10 (1–2): 125–142. arXiv:cs/9608105. CiteSeerX 10.1.1.54.9911. doi:10.1002/(SICI)1098-2418(199701/03)10:1/2<125::AID-RSA6>3.0.CO;2-X. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Jiang, Tao; Li, Ming; Vitányi, Paul (September 2000). "A Lower Bound on the Average-Case Complexity of Shellsort" (PDF). Journal of the ACM. 47 (5): 905–911. arXiv:cs/9906008. CiteSeerX 10.1.1.6.6508. doi:10.1145/355483.355488. S2CID 3265123. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Vitányi, Paul (March 2018). "On the average-case complexity of Shellsort" (PDF). Random Structures and Algorithms. 52 (2): 354–363. arXiv:1501.06461. doi:10.1002/rsa.20737. S2CID 6833808.

core.ac.uk (Global: 1,383^rd place; English: 954^th place)

Gale, David; Karp, Richard M. (April 1972). "A Phenomenon in the Theory of Sorting" (PDF). Journal of Computer and System Sciences. 6 (2): 103–115. doi:10.1016/S0022-0000(72)80016-3.

cwi.nl (Global: low place; English: low place)

homepages.cwi.nl

Jiang, Tao; Li, Ming; Vitányi, Paul (September 2000). "A Lower Bound on the Average-Case Complexity of Shellsort" (PDF). Journal of the ACM. 47 (5): 905–911. arXiv:cs/9906008. CiteSeerX 10.1.1.6.6508. doi:10.1145/355483.355488. S2CID 3265123. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Vitányi, Paul (March 2018). "On the average-case complexity of Shellsort" (PDF). Random Structures and Algorithms. 52 (2): 354–363. arXiv:1501.06461. doi:10.1002/rsa.20737. S2CID 6833808.

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

Shell, D. L. (1959). "A High-Speed Sorting Procedure" (PDF). Communications of the ACM. 2 (7): 30–32. doi:10.1145/368370.368387. S2CID 28572656. Archived from the original (PDF) on 30 August 2017. Retrieved 18 October 2011.
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.
Hibbard, Thomas N. (1963). "An Empirical Study of Minimal Storage Sorting". Communications of the ACM. 6 (5): 206–213. doi:10.1145/366552.366557. S2CID 12146844.
Incerpi, Janet; Sedgewick, Robert (1985). "Improved Upper Bounds on Shellsort" (PDF). Journal of Computer and System Sciences. 31 (2): 210–224. doi:10.1016/0022-0000(85)90042-x.
Sedgewick, Robert (1986). "A New Upper Bound for Shellsort". Journal of Algorithms. 7 (2): 159–173. doi:10.1016/0196-6774(86)90001-5.
Gale, David; Karp, Richard M. (April 1972). "A Phenomenon in the Theory of Sorting" (PDF). Journal of Computer and System Sciences. 6 (2): 103–115. doi:10.1016/S0022-0000(72)80016-3.
Selmer, Ernst S. (March 1989). "On Shellsort and the Frobenius Problem" (PDF). BIT Numerical Mathematics. 29 (1): 37–40. doi:10.1007/BF01932703. hdl:1956/19572. S2CID 32467267. Archived from the original (PDF) on 3 March 2022.
Espelid, Terje O. (December 1973). "Analysis of a Shellsort Algorithm". BIT Numerical Mathematics. 13 (4): 394–400. doi:10.1007/BF01933401. S2CID 119443598. The quoted result is equation (8) on p. 399.
Yao, Andrew Chi-Chih (1980). "An Analysis of (h, k, 1)-Shellsort" (PDF). Journal of Algorithms. 1 (1): 14–50. doi:10.1016/0196-6774(80)90003-6. S2CID 3054966. STAN-CS-79-726. Archived from the original (PDF) on 4 March 2019.
Janson, Svante; Knuth, Donald E. (1997). "Shellsort with Three Increments" (PDF). Random Structures and Algorithms. 10 (1–2): 125–142. arXiv:cs/9608105. CiteSeerX 10.1.1.54.9911. doi:10.1002/(SICI)1098-2418(199701/03)10:1/2<125::AID-RSA6>3.0.CO;2-X. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Jiang, Tao; Li, Ming; Vitányi, Paul (September 2000). "A Lower Bound on the Average-Case Complexity of Shellsort" (PDF). Journal of the ACM. 47 (5): 905–911. arXiv:cs/9906008. CiteSeerX 10.1.1.6.6508. doi:10.1145/355483.355488. S2CID 3265123. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Vitányi, Paul (March 2018). "On the average-case complexity of Shellsort" (PDF). Random Structures and Algorithms. 52 (2): 354–363. arXiv:1501.06461. doi:10.1002/rsa.20737. S2CID 6833808.
Plaxton, C. Greg; Poonen, Bjorn; Suel, Torsten (24–27 October 1992). "Improved lower bounds for Shellsort" (PDF). Proceedings., 33rd Annual Symposium on Foundations of Computer Science. Vol. 33. Pittsburgh, United States. pp. 226–235. CiteSeerX 10.1.1.43.1393. doi:10.1109/SFCS.1992.267769. ISBN 978-0-8186-2900-6. S2CID 15095863. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)CS1 maint: location missing publisher (link)
Plaxton, C. Greg; Suel, Torsten (May 1997). "Lower Bounds for Shellsort" (PDF). Journal of Algorithms. 23 (2): 221–240. CiteSeerX 10.1.1.460.2429. doi:10.1006/jagm.1996.0825. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Cypher, Robert (1993). "A Lower Bound on the Size of Shellsort Sorting Networks". SIAM Journal on Computing. 22: 62–71. doi:10.1137/0222006.

dtic.mil (Global: 934^th place; English: 530^th place)

apps.dtic.mil

Pratt, Vaughan Ronald (1979). Shellsort and Sorting Networks (Outstanding Dissertations in the Computer Sciences) (PDF). Garland. ISBN 978-0-8240-4406-0. Archived (PDF) from the original on 7 September 2021.

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

penguin.ewu.edu

Shell, D. L. (1959). "A High-Speed Sorting Procedure" (PDF). Communications of the ACM. 2 (7): 30–32. doi:10.1145/368370.368387. S2CID 28572656. Archived from the original (PDF) on 30 August 2017. Retrieved 18 October 2011.

github.com (Global: 380^th place; English: 337^th place)

"kernel/groups.c". GitHub. Retrieved 5 May 2012.

hdl.handle.net (Global: 66^th place; English: 34^th place)

Selmer, Ernst S. (March 1989). "On Shellsort and the Frobenius Problem" (PDF). BIT Numerical Mathematics. 29 (1): 37–40. doi:10.1007/BF01932703. hdl:1956/19572. S2CID 32467267. Archived from the original (PDF) on 3 March 2022.

inria.fr (Global: 6,372^nd place; English: 5,582^nd place)

hal.inria.fr

Incerpi, Janet; Sedgewick, Robert (1985). "Improved Upper Bounds on Shellsort" (PDF). Journal of Computer and System Sciences. 31 (2): 210–224. doi:10.1016/0022-0000(85)90042-x.

mathnet.ru (Global: 8,689^th place; English: low place)

Papernov, A. A.; Stasevich, G. V. (1965). "A Method of Information Sorting in Computer Memories" (PDF). Problems of Information Transmission. 1 (3): 63–75.

nih.gov (Global: 5^th place; English: 5^th place)

ncbi.nlm.nih.gov

Julian Seward. "bzip2/blocksort.c". Retrieved 30 March 2011.

nist.gov (Global: 708^th place; English: 742^nd place)

xlinux.nist.gov

Some older textbooks and references call this the "Shell–Metzner" sort after Marlene Metzner Norton, but according to Metzner, "I had nothing to do with the sort, and my name should never have been attached to it." See "Shell sort". National Institute of Standards and Technology. Retrieved 17 July 2007.

nyu.edu (Global: 1,362^nd place; English: 822^nd place)

engineering.nyu.edu

Plaxton, C. Greg; Poonen, Bjorn; Suel, Torsten (24–27 October 1992). "Improved lower bounds for Shellsort" (PDF). Proceedings., 33rd Annual Symposium on Foundations of Computer Science. Vol. 33. Pittsburgh, United States. pp. 226–235. CiteSeerX 10.1.1.43.1393. doi:10.1109/SFCS.1992.267769. ISBN 978-0-8186-2900-6. S2CID 15095863. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)CS1 maint: location missing publisher (link)
Plaxton, C. Greg; Suel, Torsten (May 1997). "Lower Bounds for Shellsort" (PDF). Journal of Algorithms. 23 (2): 221–240. CiteSeerX 10.1.1.460.2429. doi:10.1006/jagm.1996.0825. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)

polsl.pl (Global: low place; English: low place)

sun.aei.polsl.pl

Ciura, Marcin (2001). "Best Increments for the Average Case of Shellsort" (PDF). In Freiwalds, Rusins (ed.). Proceedings of the 13th International Symposium on Fundamentals of Computation Theory. London: Springer-Verlag. pp. 106–117. ISBN 978-3-540-42487-1. Archived from the original (PDF) on 23 September 2018.

psu.edu (Global: 299^th place; English: 159^th place)

citeseerx.ist.psu.edu

Janson, Svante; Knuth, Donald E. (1997). "Shellsort with Three Increments" (PDF). Random Structures and Algorithms. 10 (1–2): 125–142. arXiv:cs/9608105. CiteSeerX 10.1.1.54.9911. doi:10.1002/(SICI)1098-2418(199701/03)10:1/2<125::AID-RSA6>3.0.CO;2-X. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Jiang, Tao; Li, Ming; Vitányi, Paul (September 2000). "A Lower Bound on the Average-Case Complexity of Shellsort" (PDF). Journal of the ACM. 47 (5): 905–911. arXiv:cs/9906008. CiteSeerX 10.1.1.6.6508. doi:10.1145/355483.355488. S2CID 3265123. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Plaxton, C. Greg; Poonen, Bjorn; Suel, Torsten (24–27 October 1992). "Improved lower bounds for Shellsort" (PDF). Proceedings., 33rd Annual Symposium on Foundations of Computer Science. Vol. 33. Pittsburgh, United States. pp. 226–235. CiteSeerX 10.1.1.43.1393. doi:10.1109/SFCS.1992.267769. ISBN 978-0-8186-2900-6. S2CID 15095863. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)CS1 maint: location missing publisher (link)
Plaxton, C. Greg; Suel, Torsten (May 1997). "Lower Bounds for Shellsort" (PDF). Journal of Algorithms. 23 (2): 221–240. CiteSeerX 10.1.1.460.2429. doi:10.1006/jagm.1996.0825. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)

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

api.semanticscholar.org

Shell, D. L. (1959). "A High-Speed Sorting Procedure" (PDF). Communications of the ACM. 2 (7): 30–32. doi:10.1145/368370.368387. S2CID 28572656. Archived from the original (PDF) on 30 August 2017. Retrieved 18 October 2011.
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.
Hibbard, Thomas N. (1963). "An Empirical Study of Minimal Storage Sorting". Communications of the ACM. 6 (5): 206–213. doi:10.1145/366552.366557. S2CID 12146844.
Selmer, Ernst S. (March 1989). "On Shellsort and the Frobenius Problem" (PDF). BIT Numerical Mathematics. 29 (1): 37–40. doi:10.1007/BF01932703. hdl:1956/19572. S2CID 32467267. Archived from the original (PDF) on 3 March 2022.
Espelid, Terje O. (December 1973). "Analysis of a Shellsort Algorithm". BIT Numerical Mathematics. 13 (4): 394–400. doi:10.1007/BF01933401. S2CID 119443598. The quoted result is equation (8) on p. 399.
Yao, Andrew Chi-Chih (1980). "An Analysis of (h, k, 1)-Shellsort" (PDF). Journal of Algorithms. 1 (1): 14–50. doi:10.1016/0196-6774(80)90003-6. S2CID 3054966. STAN-CS-79-726. Archived from the original (PDF) on 4 March 2019.
Jiang, Tao; Li, Ming; Vitányi, Paul (September 2000). "A Lower Bound on the Average-Case Complexity of Shellsort" (PDF). Journal of the ACM. 47 (5): 905–911. arXiv:cs/9906008. CiteSeerX 10.1.1.6.6508. doi:10.1145/355483.355488. S2CID 3265123. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Vitányi, Paul (March 2018). "On the average-case complexity of Shellsort" (PDF). Random Structures and Algorithms. 52 (2): 354–363. arXiv:1501.06461. doi:10.1002/rsa.20737. S2CID 6833808.
Plaxton, C. Greg; Poonen, Bjorn; Suel, Torsten (24–27 October 1992). "Improved lower bounds for Shellsort" (PDF). Proceedings., 33rd Annual Symposium on Foundations of Computer Science. Vol. 33. Pittsburgh, United States. pp. 226–235. CiteSeerX 10.1.1.43.1393. doi:10.1109/SFCS.1992.267769. ISBN 978-0-8186-2900-6. S2CID 15095863. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)CS1 maint: location missing publisher (link)

pdfs.semanticscholar.org

Yao, Andrew Chi-Chih (1980). "An Analysis of (h, k, 1)-Shellsort" (PDF). Journal of Algorithms. 1 (1): 14–50. doi:10.1016/0196-6774(80)90003-6. S2CID 3054966. STAN-CS-79-726. Archived from the original (PDF) on 4 March 2019.

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

Forshell, Olof (22 May 2018). "How to choose the lengths of my sub sequences for a shell sort?". Stack Overflow. Additional commentary at Fastest gap sequence for shell sort? (23 May 2018).

uclibc.org (Global: low place; English: low place)

git.uclibc.org

Novoa, Manuel III. "libc/stdlib/stdlib.c". Retrieved 29 October 2014.

uib.no (Global: 3,363^rd place; English: 3,567^th place)

bora.uib.no

Selmer, Ernst S. (March 1989). "On Shellsort and the Frobenius Problem" (PDF). BIT Numerical Mathematics. 29 (1): 37–40. doi:10.1007/BF01932703. hdl:1956/19572. S2CID 32467267. Archived from the original (PDF) on 3 March 2022.

uu.se (Global: 3,445^th place; English: 3,148^th place)

www2.math.uu.se

Janson, Svante; Knuth, Donald E. (1997). "Shellsort with Three Increments" (PDF). Random Structures and Algorithms. 10 (1–2): 125–142. arXiv:cs/9608105. CiteSeerX 10.1.1.54.9911. doi:10.1002/(SICI)1098-2418(199701/03)10:1/2<125::AID-RSA6>3.0.CO;2-X. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)

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

cs.wcupa.edu

"Shellsort & Comparisons". Archived from the original on 20 December 2019. Retrieved 14 November 2015.

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

Pratt, Vaughan Ronald (1979). Shellsort and Sorting Networks (Outstanding Dissertations in the Computer Sciences) (PDF). Garland. ISBN 978-0-8240-4406-0. Archived (PDF) from the original on 7 September 2021.
"Shellsort & Comparisons". Archived from the original on 20 December 2019. Retrieved 14 November 2015.
Shell, D. L. (1959). "A High-Speed Sorting Procedure" (PDF). Communications of the ACM. 2 (7): 30–32. doi:10.1145/368370.368387. S2CID 28572656. Archived from the original (PDF) on 30 August 2017. Retrieved 18 October 2011.
Ciura, Marcin (2001). "Best Increments for the Average Case of Shellsort" (PDF). In Freiwalds, Rusins (ed.). Proceedings of the 13th International Symposium on Fundamentals of Computation Theory. London: Springer-Verlag. pp. 106–117. ISBN 978-3-540-42487-1. Archived from the original (PDF) on 23 September 2018.
Selmer, Ernst S. (March 1989). "On Shellsort and the Frobenius Problem" (PDF). BIT Numerical Mathematics. 29 (1): 37–40. doi:10.1007/BF01932703. hdl:1956/19572. S2CID 32467267. Archived from the original (PDF) on 3 March 2022.
Yao, Andrew Chi-Chih (1980). "An Analysis of (h, k, 1)-Shellsort" (PDF). Journal of Algorithms. 1 (1): 14–50. doi:10.1016/0196-6774(80)90003-6. S2CID 3054966. STAN-CS-79-726. Archived from the original (PDF) on 4 March 2019.

Shellsort (English Wikipedia)

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

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

core.ac.uk (Global: 1,383rd place; English: 954th place)

cwi.nl (Global: low place; English: low place)

homepages.cwi.nl

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

dtic.mil (Global: 934th place; English: 530th place)

apps.dtic.mil

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

penguin.ewu.edu

github.com (Global: 380th place; English: 337th place)

hdl.handle.net (Global: 66th place; English: 34th place)

inria.fr (Global: 6,372nd place; English: 5,582nd place)

hal.inria.fr

mathnet.ru (Global: 8,689th place; English: low place)

nih.gov (Global: 5th place; English: 5th place)

ncbi.nlm.nih.gov

nist.gov (Global: 708th place; English: 742nd place)

xlinux.nist.gov

nyu.edu (Global: 1,362nd place; English: 822nd place)

engineering.nyu.edu

polsl.pl (Global: low place; English: low place)

sun.aei.polsl.pl

psu.edu (Global: 299th place; English: 159th place)

citeseerx.ist.psu.edu

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

api.semanticscholar.org

pdfs.semanticscholar.org

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

uclibc.org (Global: low place; English: low place)

git.uclibc.org

uib.no (Global: 3,363rd place; English: 3,567th place)

bora.uib.no

uu.se (Global: 3,445th place; English: 3,148th place)

www2.math.uu.se

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

cs.wcupa.edu

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

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

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

core.ac.uk (Global: 1,383^rd place; English: 954^th place)

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

dtic.mil (Global: 934^th place; English: 530^th place)

github.com (Global: 380^th place; English: 337^th place)

hdl.handle.net (Global: 66^th place; English: 34^th place)

inria.fr (Global: 6,372^nd place; English: 5,582^nd place)

mathnet.ru (Global: 8,689^th place; English: low place)

nih.gov (Global: 5^th place; English: 5^th place)

nist.gov (Global: 708^th place; English: 742^nd place)

nyu.edu (Global: 1,362^nd place; English: 822^nd place)

psu.edu (Global: 299^th place; English: 159^th place)

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

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

uib.no (Global: 3,363^rd place; English: 3,567^th place)

uu.se (Global: 3,445^th place; English: 3,148^th place)

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