Merge sort (English Wikipedia)

Axtmann, Michael; Bingmann, Timo; Sanders, Peter; Schulz, Christian (2015). "Practical Massively Parallel Sorting". Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures. pp. 13–23. arXiv:1410.6754. doi:10.1145/2755573.2755595. ISBN 978-1-4503-3588-1. S2CID 18249978.

diku.dk (Global: low place; English: low place)

Katajainen, Pasanen & Teuhola (1996) Katajainen, Jyrki; Pasanen, Tomi; Teuhola, Jukka (1996). "Practical in-place mergesort". Nordic Journal of Computing. 3 (1): 27–40. ISSN 1236-6064. Archived from the original on 2011-08-07. Retrieved 2009-04-04.. Also Practical In-Place Mergesort. Also

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

Katajainen, Jyrki; Träff, Jesper Larsson (March 1997). "Algorithms and Complexity". Proceedings of the 3rd Italian Conference on Algorithms and Complexity. Italian Conference on Algorithms and Complexity. Lecture Notes in Computer Science. Vol. 1203. Rome. pp. 217–228. doi:10.1007/3-540-62592-5_74. ISBN 978-3-540-62592-6.
Geffert, Viliam; Katajainen, Jyrki; Pasanen, Tomi (2000). "Asymptotically efficient in-place merging". Theoretical Computer Science. 237 (1–2): 159–181. doi:10.1016/S0304-3975(98)00162-5.
Huang, Bing-Chao; Langston, Michael A. (March 1988). "Practical In-Place Merging". Communications of the ACM. 31 (3): 348–352. doi:10.1145/42392.42403. S2CID 4841909.
Kim, Pok-Son; Kutzner, Arne (2004). "Stable Minimum Storage Merging by Symmetric Comparisons". Algorithms – ESA 2004. European Symp. Algorithms. Lecture Notes in Computer Science. Vol. 3221. pp. 714–723. doi:10.1007/978-3-540-30140-0_63. ISBN 978-3-540-23025-0.
Axtmann, Michael; Bingmann, Timo; Sanders, Peter; Schulz, Christian (2015). "Practical Massively Parallel Sorting". Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures. pp. 13–23. arXiv:1410.6754. doi:10.1145/2755573.2755595. ISBN 978-1-4503-3588-1. S2CID 18249978.
Cole, Richard (August 1988). "Parallel merge sort". SIAM J. Comput. 17 (4): 770–785. doi:10.1137/0217049. S2CID 2416667.

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

"WikiSort. Fast and stable sort algorithm that uses O(1) memory. Public domain". GitHub. 14 Apr 2014.
"Quadsort is a branchless stable adaptive merge sort". GitHub. 8 Jun 2022.
Victor J. Duvanenko "Parallel Merge Sort" Dr. Dobb's Journal & blog and GitHub repo C++ implementation
linux kernel /lib/list_sort.c

i-programmer.info (Global: low place; English: low place)

James, Mike (2022-12-21). "Python Now Uses Powersort". i-programmer.info. Retrieved 2024-05-08.

java.net (Global: low place; English: low place)

hg.openjdk.java.net

coleenp (22 Feb 2019). "src/java.base/share/classes/java/util/Arrays.java @ 53904:9c3fe09f69bc". OpenJDK.

kit.edu (Global: 520^th place; English: 7,067^th place)

algo2.iti.kit.edu

Peter Sanders; Johannes Singler (2008). "Lecture Parallel algorithms" (PDF). Retrieved 2020-05-02.
Peter Sanders (2019). "Lecture Parallel algorithms" (PDF). Retrieved 2020-05-02.

publikationen.bibliothek.kit.edu

Axtmann, Michael; Bingmann, Timo; Sanders, Peter; Schulz, Christian (2015). "Practical Massively Parallel Sorting". Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures. pp. 13–23. arXiv:1410.6754. doi:10.1145/2755573.2755595. ISBN 978-1-4503-3588-1. S2CID 18249978.

koreascience.kr (Global: low place; English: low place)

Kim, Pok-Son; Kutzner, Arne (1 Sep 2003). "A New Method for Efficient in-Place Merging". Proceedings of the Korean Institute of Intelligent Systems Conference: 392–394.

microsoft.com (Global: 263^rd place; English: 259^th place)

research.microsoft.com

Chandramouli, Badrish; Goldstein, Jonathan (2014). Patience is a Virtue: Revisiting Merge and Sort on Modern Processors (PDF). SIGMOD/PODS.

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

perldoc.perl.org

"Sort – Perl 5 version 8.8 documentation". Retrieved 2020-08-23.

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

citeseer.ist.psu.edu

Katajainen, Pasanen & Teuhola (1996) Katajainen, Jyrki; Pasanen, Tomi; Teuhola, Jukka (1996). "Practical in-place mergesort". Nordic Journal of Computing. 3 (1): 27–40. ISSN 1236-6064. Archived from the original on 2011-08-07. Retrieved 2009-04-04.. Also Practical In-Place Mergesort. Also
Powers, David M. W. (1991). "Parallelized Quicksort and Radixsort with Optimal Speedup". Proceedings of International Conference on Parallel Computing Technologies, Novosibirsk. Archived from the original on 2007-05-25.{{cite book}}: CS1 maint: miscellaneous url (link)

citeseerx.ist.psu.edu

Katajainen, Pasanen & Teuhola (1996) Katajainen, Jyrki; Pasanen, Tomi; Teuhola, Jukka (1996). "Practical in-place mergesort". Nordic Journal of Computing. 3 (1): 27–40. ISSN 1236-6064. Archived from the original on 2011-08-07. Retrieved 2009-04-04.. Also Practical In-Place Mergesort. Also

sciencedirect.com (Global: 137^th place; English: 146^th place)

Oladipupo, Esau Taiwo; Abikoye, Oluwakemi Christianah (2020). "Comparison of quicksort and mergesort". Third International Conference on Computing and Network Communications (CoCoNet 2019). 2020 (2020): 9. Retrieved 2024-01-20 – via Elsevier Science Direct.

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

api.semanticscholar.org

Huang, Bing-Chao; Langston, Michael A. (March 1988). "Practical In-Place Merging". Communications of the ACM. 31 (3): 348–352. doi:10.1145/42392.42403. S2CID 4841909.
Axtmann, Michael; Bingmann, Timo; Sanders, Peter; Schulz, Christian (2015). "Practical Massively Parallel Sorting". Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures. pp. 13–23. arXiv:1410.6754. doi:10.1145/2755573.2755595. ISBN 978-1-4503-3588-1. S2CID 18249978.
Cole, Richard (August 1988). "Parallel merge sort". SIAM J. Comput. 17 (4): 770–785. doi:10.1137/0217049. S2CID 2416667.

tech.blog (Global: low place; English: low place)

duvanenko.tech.blog

Victor J. Duvanenko "Parallel Merge Sort" Dr. Dobb's Journal & blog and GitHub repo C++ implementation

techxplore.com (Global: low place; English: low place)

University of Liverpool (2022-12-12). "Computer scientists improve Python sorting function". Tech Xplore. Retrieved 2024-05-08.

unipi.it (Global: low place; English: low place)

didawiki.cli.di.unipi.it

Ferragina, Paolo (2009–2019), "5. Sorting Atomic Items" (PDF), The magic of Algorithms!, p. 5-4, archived (PDF) from the original on 2021-05-12

wardpowers.info (Global: low place; English: low place)

david.wardpowers.info

Powers, David M. W. (January 1995). Parallel Unification: Practical Complexity (PDF). Australasian Computer Architecture Workshop Flinders University.

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

Katajainen, Pasanen & Teuhola (1996) Katajainen, Jyrki; Pasanen, Tomi; Teuhola, Jukka (1996). "Practical in-place mergesort". Nordic Journal of Computing. 3 (1): 27–40. ISSN 1236-6064. Archived from the original on 2011-08-07. Retrieved 2009-04-04.. Also Practical In-Place Mergesort. Also
Ferragina, Paolo (2009–2019), "5. Sorting Atomic Items" (PDF), The magic of Algorithms!, p. 5-4, archived (PDF) from the original on 2021-05-12
Powers, David M. W. (1991). "Parallelized Quicksort and Radixsort with Optimal Speedup". Proceedings of International Conference on Parallel Computing Technologies, Novosibirsk. Archived from the original on 2007-05-25.{{cite book}}: CS1 maint: miscellaneous url (link)

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

search.worldcat.org

Jayalakshmi, N. (2007). Data structure using C++. Firewall Media. ISBN 978-81-318-0020-1. OCLC 849900742.
Katajainen, Pasanen & Teuhola (1996) Katajainen, Jyrki; Pasanen, Tomi; Teuhola, Jukka (1996). "Practical in-place mergesort". Nordic Journal of Computing. 3 (1): 27–40. ISSN 1236-6064. Archived from the original on 2011-08-07. Retrieved 2009-04-04.. Also Practical In-Place Mergesort. Also

Merge sort (English Wikipedia)

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

diku.dk (Global: low place; English: low place)

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

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

i-programmer.info (Global: low place; English: low place)

java.net (Global: low place; English: low place)

hg.openjdk.java.net

kit.edu (Global: 520th place; English: 7,067th place)

algo2.iti.kit.edu

publikationen.bibliothek.kit.edu

koreascience.kr (Global: low place; English: low place)

microsoft.com (Global: 263rd place; English: 259th place)

research.microsoft.com

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

perldoc.perl.org

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

citeseer.ist.psu.edu

citeseerx.ist.psu.edu

sciencedirect.com (Global: 137th place; English: 146th place)

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

api.semanticscholar.org

tech.blog (Global: low place; English: low place)

duvanenko.tech.blog

techxplore.com (Global: low place; English: low place)

unipi.it (Global: low place; English: low place)

didawiki.cli.di.unipi.it

wardpowers.info (Global: low place; English: low place)

david.wardpowers.info

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

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

search.worldcat.org

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

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

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

kit.edu (Global: 520^th place; English: 7,067^th place)

microsoft.com (Global: 263^rd place; English: 259^th place)

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

sciencedirect.com (Global: 137^th place; English: 146^th place)

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

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

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