Sorting algorithm (English Wikipedia)

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

refsWebsite

Global rank English rank

15web.archive.org

1^st place

12doi.org

2^nd place

3books.google.com

3^rd place

3semanticscholar.org

11^th place

8^th place

2psu.edu

207^th place

136^th place

1mentalfloss.com

1,139^th place

709^th place

1nytimes.com

7^th place

1proquest.com

206^th place

124^th place

1uni-leipzig.de

2,676^th place

5,949^th place

1algolist.net

low place

1drdobbs.com

7,788^th place

5,521^st place

1arxiv.org

69^th place

59^th place

1hermann-gruber.com

low place

1worldcat.org

5^th place

1python.org

2,232^nd place

1,903^rd place

1java.net

low place

7,566^th place

1perl.org

low place

9,807^th place

1sun.com

5,060^th place

4,600^th place

1ewu.edu

low place

1github.com

383^rd place

320^th place

1codingunit.com

low place

1mathbits.com

low place

1pcmag.com

1,060^th place

700^th place

algolist.net

"SELECTION SORT (Java, C++) – Algorithms and Data Structures". Algolist.net. Archived from the original on 9 December 2012. Retrieved 14 April 2018.

arxiv.org

Fung, Stanley P. Y. (3 October 2021). "Is this the simplest (and most surprising) sorting algorithm ever?". arXiv:2110.01111 [cs.DS].

books.google.com

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009), "8", Introduction To Algorithms (3rd ed.), Cambridge, MA: The MIT Press, p. 167, ISBN 978-0-262-03293-3
Sedgewick, Robert (1 September 1998). Algorithms In C: Fundamentals, Data Structures, Sorting, Searching, Parts 1-4 (3 ed.). Pearson Education. ISBN 978-81-317-1291-7. Retrieved 27 November 2012.
Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001), "8", Introduction To Algorithms (2nd ed.), Cambridge, MA: The MIT Press, p. 165, ISBN 0-262-03293-7

codingunit.com

"Exchange Sort Algorithm". CodingUnit Programming Tutorials. Archived from the original on 2021-07-10. Retrieved 2021-07-10.

doi.org

Huang, B. C.; Langston, M. A. (December 1992). "Fast Stable Merging and Sorting in Constant Extra Space". Comput. J. 35 (6): 643–650. CiteSeerX 10.1.1.54.8381. doi:10.1093/comjnl/35.6.643.
Ajtai, M.; Komlós, J.; Szemerédi, E. (1983). An $O(n log n)$ sorting network. STOC '83. Proceedings of the fifteenth annual ACM symposium on Theory of computing. pp. 1–9. doi:10.1145/800061.808726. ISBN 0-89791-099-0.
Kim, P. S.; Kutzner, A. (2008). Ratio Based Stable In-Place Merging. TAMC 2008. Theory and Applications of Models of Computation. LNCS. Vol. 4978. pp. 246–257. CiteSeerX 10.1.1.330.2641. doi:10.1007/978-3-540-79228-4_22. ISBN 978-3-540-79227-7.
Sedgewick, R. (1978). "Implementing Quicksort programs". Comm. ACM. 21 (10): 847–857. doi:10.1145/359619.359631. S2CID 10020756.
Gruber, H.; Holzer, M.; Ruepp, O., "Sorting the slow way: an analysis of perversely awful randomized sorting algorithms", 4th International Conference on Fun with Algorithms, Castiglioncello, Italy, 2007 (PDF), Lecture Notes in Computer Science, vol. 4475, Springer-Verlag, pp. 183–197, doi:10.1007/978-3-540-72914-3_17, archived (PDF) from the original on 2020-09-29, retrieved 2020-06-27.
Franceschini, G. (June 2007). "Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves". Theory of Computing Systems. 40 (4): 327–353. doi:10.1007/s00224-006-1311-1.
Thorup, M. (February 2002). "Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations". Journal of Algorithms. 42 (2): 205–230. doi:10.1006/jagm.2002.1211. S2CID 9700543.
Han, Yijie; Thorup, M. (2002). Integer sorting in O(n√(log log n)) expected time and linear space. The 43rd Annual IEEE Symposium on Foundations of Computer Science. pp. 135–144. doi:10.1109/SFCS.2002.1181890. ISBN 0-7695-1822-2.
Han, Yijie (2020-04-01). "Sorting Real Numbers in $$O\big (n\sqrt{\log n}\big )$$ Time and Linear Space". Algorithmica. 82 (4): 966–978. doi:10.1007/s00453-019-00626-0. ISSN 1432-0541.
Musser, David R. (1997), "Introspective Sorting and Selection Algorithms", Software: Practice and Experience, 27 (8): 983–993, doi:10.1002/(SICI)1097-024X(199708)27:8<983::AID-SPE117>3.0.CO;2-#
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 2017-08-30. Retrieved 2020-03-23.
Brejová, B. (15 September 2001). "Analyzing variants of Shellsort". Inf. Process. Lett. 79 (5): 223–227. doi:10.1016/S0020-0190(00)00223-4.

drdobbs.com

Nilsson, Stefan (2000). "The Fastest Sorting Algorithm?". Dr. Dobb's. Archived from the original on 2019-06-08. Retrieved 2015-11-23.

ewu.edu

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 2017-08-30. Retrieved 2020-03-23.

github.com

"kernel/groups.c". GitHub. Archived from the original on 2021-02-25. Retrieved 2012-05-05.

hermann-gruber.com

Gruber, H.; Holzer, M.; Ruepp, O., "Sorting the slow way: an analysis of perversely awful randomized sorting algorithms", 4th International Conference on Fun with Algorithms, Castiglioncello, Italy, 2007 (PDF), Lecture Notes in Computer Science, vol. 4475, Springer-Verlag, pp. 183–197, doi:10.1007/978-3-540-72914-3_17, archived (PDF) from the original on 2020-09-29, retrieved 2020-06-27.

java.net

cr.openjdk.java.net

"OpenJDK's TimSort.java". java.net. Archived from the original on 14 August 2011. Retrieved 14 April 2018.

mathbits.com

"Exchange Sort". JavaBitsNotebook.com. Archived from the original on 2021-07-10. Retrieved 2021-07-10.

mentalfloss.com

"Meet the 'Refrigerator Ladies' Who Programmed the ENIAC". Mental Floss. 2013-10-13. Archived from the original on 2018-10-08. Retrieved 2016-06-16.

nytimes.com

Lohr, Steve (Dec 17, 2001). "Frances E. Holberton, 84, Early Computer Programmer". NYTimes. Archived from the original on 16 December 2014. Retrieved 16 December 2014.

pcmag.com

"tag sort Definition from PC Magazine Encyclopedia". Pcmag.com. Archived from the original on 6 October 2012. Retrieved 14 April 2018.

perl.org

perldoc.perl.org

"sort – perldoc.perl.org". perldoc.perl.org. Archived from the original on 14 April 2018. Retrieved 14 April 2018.

proquest.com

search.proquest.com

Demuth, Howard B. (1956). Electronic Data Sorting (PhD thesis). Stanford University. ProQuest 301940891.

psu.edu

citeseerx.ist.psu.edu

Huang, B. C.; Langston, M. A. (December 1992). "Fast Stable Merging and Sorting in Constant Extra Space". Comput. J. 35 (6): 643–650. CiteSeerX 10.1.1.54.8381. doi:10.1093/comjnl/35.6.643.
Kim, P. S.; Kutzner, A. (2008). Ratio Based Stable In-Place Merging. TAMC 2008. Theory and Applications of Models of Computation. LNCS. Vol. 4978. pp. 246–257. CiteSeerX 10.1.1.330.2641. doi:10.1007/978-3-540-79228-4_22. ISBN 978-3-540-79227-7.

python.org

svn.python.org

"Tim Peters's original description of timsort". python.org. Archived from the original on 22 January 2018. Retrieved 14 April 2018.

semanticscholar.org

api.semanticscholar.org

Sedgewick, R. (1978). "Implementing Quicksort programs". Comm. ACM. 21 (10): 847–857. doi:10.1145/359619.359631. S2CID 10020756.
Thorup, M. (February 2002). "Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations". Journal of Algorithms. 42 (2): 205–230. doi:10.1006/jagm.2002.1211. S2CID 9700543.
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 2017-08-30. Retrieved 2020-03-23.

sun.com

java.sun.com

Merge sort in Java 1.3, Sun. Archived 2009-03-04 at the Wayback Machine

uni-leipzig.de

dbs.uni-leipzig.de

Prof. E. Rahm. "Sortierverfahren" (PDF). Dbs.uni-leipzig.de. Archived (PDF) from the original on 23 August 2022. Retrieved 1 March 2022.

web.archive.org

"Meet the 'Refrigerator Ladies' Who Programmed the ENIAC". Mental Floss. 2013-10-13. Archived from the original on 2018-10-08. Retrieved 2016-06-16.
Lohr, Steve (Dec 17, 2001). "Frances E. Holberton, 84, Early Computer Programmer". NYTimes. Archived from the original on 16 December 2014. Retrieved 16 December 2014.
Prof. E. Rahm. "Sortierverfahren" (PDF). Dbs.uni-leipzig.de. Archived (PDF) from the original on 23 August 2022. Retrieved 1 March 2022.
"SELECTION SORT (Java, C++) – Algorithms and Data Structures". Algolist.net. Archived from the original on 9 December 2012. Retrieved 14 April 2018.
Nilsson, Stefan (2000). "The Fastest Sorting Algorithm?". Dr. Dobb's. Archived from the original on 2019-06-08. Retrieved 2015-11-23.
Gruber, H.; Holzer, M.; Ruepp, O., "Sorting the slow way: an analysis of perversely awful randomized sorting algorithms", 4th International Conference on Fun with Algorithms, Castiglioncello, Italy, 2007 (PDF), Lecture Notes in Computer Science, vol. 4475, Springer-Verlag, pp. 183–197, doi:10.1007/978-3-540-72914-3_17, archived (PDF) from the original on 2020-09-29, retrieved 2020-06-27.
"Tim Peters's original description of timsort". python.org. Archived from the original on 22 January 2018. Retrieved 14 April 2018.
"OpenJDK's TimSort.java". java.net. Archived from the original on 14 August 2011. Retrieved 14 April 2018.
"sort – perldoc.perl.org". perldoc.perl.org. Archived from the original on 14 April 2018. Retrieved 14 April 2018.
Merge sort in Java 1.3, Sun. Archived 2009-03-04 at the Wayback Machine
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 2017-08-30. Retrieved 2020-03-23.
"kernel/groups.c". GitHub. Archived from the original on 2021-02-25. Retrieved 2012-05-05.
"Exchange Sort Algorithm". CodingUnit Programming Tutorials. Archived from the original on 2021-07-10. Retrieved 2021-07-10.
"Exchange Sort". JavaBitsNotebook.com. Archived from the original on 2021-07-10. Retrieved 2021-07-10.
"tag sort Definition from PC Magazine Encyclopedia". Pcmag.com. Archived from the original on 6 October 2012. Retrieved 14 April 2018.

worldcat.org

Han, Yijie (2020-04-01). "Sorting Real Numbers in $$O\big (n\sqrt{\log n}\big )$$ Time and Linear Space". Algorithmica. 82 (4): 966–978. doi:10.1007/s00453-019-00626-0. ISSN 1432-0541.