Heapsort (English Wikipedia)

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

Last modified: 13:44:13, 7 September 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

2616doi.org

2^nd place

199semanticscholar.org

15^th place

8^th place

63web.archive.org

1^st place

55arxiv.org

49^th place

31^st place

53diku.dk

low place

52mpg.de

1,722^nd place

1,710^th place

42core.ac.uk

1,383^rd place

954^th place

42auckland.ac.nz

3,907^th place

2,379^th place

31hdl.handle.net

66^th place

34^th place

31gutech.edu.om

low place

21mcgill.ca

2,445^th place

1,513^th place

21inference.org.uk

low place

11cmu.edu

2,125^th place

1,347^th place

11princeton.edu

802^nd place

528^th place

11archive.org

6^th place

11zbmath.org

2,089^th place

1,141^st place

11utexas.edu

868^th place

634^th place

11wikidata.org

10^th place

98^th place

11keithschwarz.com

low place

11github.com

380^th place

337^th place

11kernel.org

5,383^rd place

3,622^nd place

11researchgate.net

96^th place

89^th place

11dagstuhl.de

low place

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

Cantone, Domenico; Concotti, Gianluca (1–3 March 2000). QuickHeapsort, an efficient mix of classical sorting algorithms. 4th Italian Conference on Algorithms and Complexity. Lecture Notes in Computer Science. Vol. 1767. Rome. pp. 150–162. ISBN 3-540-67159-5.

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

Suchenek, Marek A. (7 April 2015). "A Complete Worst-Case Analysis of Heapsort with Experimental Verification of Its Results, A manuscript". arXiv:1504.01459 [cs.DS].
Diekert, Volker; Weiß, Armin (August 2016). "QuickHeapsort: Modifications and improved analysis". Theory of Computing Systems. 59 (2): 209–230. arXiv:1209.4214. doi:10.1007/s00224-015-9656-y. S2CID 792585.
Peters, Orson R. L. (9 June 2021). "Pattern-defeating Quicksort". arXiv:2106.05123 [cs.DS].
Peters, Orson R. L. "pdqsort". Github. Retrieved 2 October 2023.
Edelkamp, Stefan; Weiß, Armin (30 January 2019). "BlockQuicksort: Avoiding Branch Mispredictions in Quicksort" (PDF). Journal of Experimental Algorithmics. 24 1.4. arXiv:1604.06697. doi:10.1145/3274660.
Aumüller, Martin; Hass, Nikolaj (7–8 January 2019). Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme. Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX). San Diego. arXiv:1810.12047. doi:10.1137/1.9781611975499.2.

auckland.ac.nz (Global: 3,907^th place; English: 2,379^th place)

cs.auckland.ac.nz

LaMarca, Anthony; Ladner, Richard E. (April 1999). "The Influence of Caches on the Performance of Sorting" (PDF). Journal of Algorithms. 31 (1): 66–104. doi:10.1006/jagm.1998.0985. S2CID 206567217. See particularly figure 9c on p. 98.
Morris, John (1998). "Comparing Quick and Heap Sorts". Data Structures and Algorithms (Lecture notes). University of Western Australia. Retrieved 12 February 2021.

cmu.edu (Global: 2,125^th place; English: 1,347^th place)

math.cmu.edu

Bollobás, B.; Fenner, T. I.; Frieze, A. M. (1996). "On the Best Case of Heapsort" (PDF). Journal of Algorithms. 20 (11): 205–217. doi:10.1006/jagm.1996.0011.

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

Wegener, Ingo (13 September 1993). "Bottom-Up Heapsort, a new variant of Heapsort beating, on an average, Quicksort (if $n$ is not very small)" (PDF). Theoretical Computer Science. 118 (1): 81–98. doi:10.1016/0304-3975(93)90364-y. Although this is a reprint of work first published in 1990 (at the Mathematical Foundations of Computer Science conference), the technique was published by Carlsson in 1987.^[17]
Cantone, Domenico; Concotti, Gianluca (August 2002). "QuickHeapsort, an efficient mix of classical sorting algorithms" (PDF). Theoretical Computer Science. 285 (1): 25–42. doi:10.1016/S0304-3975(01)00288-2. Zbl 1016.68042.

dagstuhl.de (Global: low place; English: low place)

drops.dagstuhl.de

Edelkamp, Stefan; Weiß, Armin (30 January 2019). "BlockQuicksort: Avoiding Branch Mispredictions in Quicksort" (PDF). Journal of Experimental Algorithmics. 24 1.4. arXiv:1604.06697. doi:10.1145/3274660.

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

hjemmesider.diku.dk

Bojesen, Jesper; Katajainen, Jyrki; Spork, Maz (2000). "Performance Engineering Case Study: Heap Construction" (PostScript). ACM Journal of Experimental Algorithmics. 5 (15): 15–es. doi:10.1145/351827.384257. S2CID 30995934. Alternate PDF source.
Katajainen, Jyrki (23 September 2013). Seeking for the best priority queue: Lessons learnt. Algorithm Engineering (Seminar 13391). Dagstuhl. pp. 19–20, 24.
Katajainen, Jyrki (2–3 February 1998). The Ultimate Heapsort. Computing: the 4th Australasian Theory Symposium. Australian Computer Science Communications. Vol. 20, no. 3. Perth. pp. 87–96.

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

Bollobás, B.; Fenner, T. I.; Frieze, A. M. (1996). "On the Best Case of Heapsort" (PDF). Journal of Algorithms. 20 (11): 205–217. doi:10.1006/jagm.1996.0011.
Williams 1964 Williams, J. W. J. (1964). "Algorithm 232 – Heapsort". Communications of the ACM. 7 (6): 347–348. doi:10.1145/512274.512284.
Suchenek, Marek A. (2012). "Elementary Yet Precise Worst-Case Analysis of Floyd's Heap-Construction Program". Fundamenta Informaticae. 120 (1): 75–92. doi:10.3233/FI-2012-751.
Bojesen, Jesper; Katajainen, Jyrki; Spork, Maz (2000). "Performance Engineering Case Study: Heap Construction" (PostScript). ACM Journal of Experimental Algorithmics. 5 (15): 15–es. doi:10.1145/351827.384257. S2CID 30995934. Alternate PDF source.
Wegener, Ingo (13 September 1993). "Bottom-Up Heapsort, a new variant of Heapsort beating, on an average, Quicksort (if $n$ is not very small)" (PDF). Theoretical Computer Science. 118 (1): 81–98. doi:10.1016/0304-3975(93)90364-y. Although this is a reprint of work first published in 1990 (at the Mathematical Foundations of Computer Science conference), the technique was published by Carlsson in 1987.^[17]
Fleischer, Rudolf (February 1994). "A tight lower bound for the worst case of Bottom-Up-Heapsort" (PDF). Algorithmica. 11 (2): 104–115. doi:10.1007/bf01182770. hdl:11858/00-001M-0000-0014-7B02-C. S2CID 21075180. Archived from the original (PDF) on 14 June 2018. Retrieved 14 June 2018. Also available as Fleischer, Rudolf (April 1991). A tight lower bound for the worst case of Bottom-Up-Heapsort (PDF) (Technical report). MPI-INF. MPI-I-91-104.
McDiarmid, C. J. H.; Reed, B. A. (September 1989). "Building heaps fast" (PDF). Journal of Algorithms. 10 (3): 352–365. doi:10.1016/0196-6774(89)90033-3.
Carlsson, Scante (March 1987). "A variant of heapsort with almost optimal number of comparisons" (PDF). Information Processing Letters. 24 (4): 247–250. doi:10.1016/0020-0190(87)90142-6. S2CID 28135103. Archived from the original (PDF) on 27 December 2016.
Wegener, Ingo (March 1992). "The worst-case complexity of McDiarmid and Reed's variant of Bottom-Up Heapsort is less than n log n + 1.1n". Information and Computation. 97 (1): 86–96. doi:10.1016/0890-5401(92)90005-Z.
LaMarca, Anthony; Ladner, Richard E. (April 1999). "The Influence of Caches on the Performance of Sorting" (PDF). Journal of Algorithms. 31 (1): 66–104. doi:10.1006/jagm.1998.0985. S2CID 206567217. See particularly figure 9c on p. 98.
Chen, Jingsen; Edelkamp, Stefan; Elmasry, Amr; Katajainen, Jyrki (27–31 August 2012). "In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses" (PDF). Mathematical Foundations of Computer Science 2012. 37th international conference on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science. Vol. 7464. pp. 259–270. doi:10.1007/978-3-642-32589-2_25. ISBN 978-3-642-32588-5. S2CID 1462216. Archived from the original (PDF) on 29 December 2016. See particularly Fig. 3.
Cantone, Domenico; Concotti, Gianluca (August 2002). "QuickHeapsort, an efficient mix of classical sorting algorithms" (PDF). Theoretical Computer Science. 285 (1): 25–42. doi:10.1016/S0304-3975(01)00288-2. Zbl 1016.68042.
Diekert, Volker; Weiß, Armin (August 2016). "QuickHeapsort: Modifications and improved analysis". Theory of Computing Systems. 59 (2): 209–230. arXiv:1209.4214. doi:10.1007/s00224-015-9656-y. S2CID 792585.
Levcopoulos, Christos; Petersson, Ola (1989). "Heapsort—Adapted for Presorted Files". WADS '89: Proceedings of the Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science. Vol. 382. London, UK: Springer-Verlag. pp. 499–509. doi:10.1007/3-540-51542-9_41. ISBN 978-3-540-51542-5. Heapsort—Adapted for presorted files (Q56049336).
Edelkamp, Stefan; Weiß, Armin (30 January 2019). "BlockQuicksort: Avoiding Branch Mispredictions in Quicksort" (PDF). Journal of Experimental Algorithmics. 24 1.4. arXiv:1604.06697. doi:10.1145/3274660.
Aumüller, Martin; Hass, Nikolaj (7–8 January 2019). Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme. Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX). San Diego. arXiv:1810.12047. doi:10.1137/1.9781611975499.2.

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

Peters, Orson R. L. (9 June 2021). "Pattern-defeating Quicksort". arXiv:2106.05123 [cs.DS].
Peters, Orson R. L. "pdqsort". Github. Retrieved 2 October 2023.

gutech.edu.om (Global: low place; English: low place)

staff.gutech.edu.om

Fleischer, Rudolf (February 1994). "A tight lower bound for the worst case of Bottom-Up-Heapsort" (PDF). Algorithmica. 11 (2): 104–115. doi:10.1007/bf01182770. hdl:11858/00-001M-0000-0014-7B02-C. S2CID 21075180. Archived from the original (PDF) on 14 June 2018. Retrieved 14 June 2018. Also available as Fleischer, Rudolf (April 1991). A tight lower bound for the worst case of Bottom-Up-Heapsort (PDF) (Technical report). MPI-INF. MPI-I-91-104.

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

Fleischer, Rudolf (February 1994). "A tight lower bound for the worst case of Bottom-Up-Heapsort" (PDF). Algorithmica. 11 (2): 104–115. doi:10.1007/bf01182770. hdl:11858/00-001M-0000-0014-7B02-C. S2CID 21075180. Archived from the original (PDF) on 14 June 2018. Retrieved 14 June 2018. Also available as Fleischer, Rudolf (April 1991). A tight lower bound for the worst case of Bottom-Up-Heapsort (PDF) (Technical report). MPI-INF. MPI-I-91-104.

inference.org.uk (Global: low place; English: low place)

MacKay, David J. C. (December 2005). "Heapsort, Quicksort, and Entropy". Retrieved 12 February 2021.

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

Schwartz, Keith (27 December 2010). "CartesianTreeSort.hh". Archive of Interesting Code. Retrieved 5 March 2019.

kernel.org (Global: 5,383^rd place; English: 3,622^nd place)

git.kernel.org

https://git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git/tree/lib/sort.c#n205 Linux kernel source

mcgill.ca (Global: 2,445^th place; English: 1,513^th place)

cgm.cs.mcgill.ca

McDiarmid, C. J. H.; Reed, B. A. (September 1989). "Building heaps fast" (PDF). Journal of Algorithms. 10 (3): 352–365. doi:10.1016/0196-6774(89)90033-3.

mpg.de (Global: 1,722^nd place; English: 1,710^th place)

pubman.mpdl.mpg.de

Fleischer, Rudolf (February 1994). "A tight lower bound for the worst case of Bottom-Up-Heapsort" (PDF). Algorithmica. 11 (2): 104–115. doi:10.1007/bf01182770. hdl:11858/00-001M-0000-0014-7B02-C. S2CID 21075180. Archived from the original (PDF) on 14 June 2018. Retrieved 14 June 2018. Also available as Fleischer, Rudolf (April 1991). A tight lower bound for the worst case of Bottom-Up-Heapsort (PDF) (Technical report). MPI-INF. MPI-I-91-104.

people.mpi-inf.mpg.de

Mehlhorn, Kurt; Sanders, Peter (2008). "Priority Queues" (PDF). Algorithms and Data Structures: The Basic Toolbox. Springer. p. 142. ISBN 978-3-540-77977-3.

princeton.edu (Global: 802^nd place; English: 528^th place)

cs.princeton.edu

Sedgewick, Robert; Schaffer, Russel W. (October 1990). The Best Case of Heapsort (Technical report). Princeton University. TR-293-90.

researchgate.net (Global: 96^th place; English: 89^th place)

Maus, Arne [in Norwegian] (14 May 2014). "Sorting by generating the sorting permutation, and the effect of caching on sorting". See Fig. 1 on p. 6.

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

api.semanticscholar.org

Bojesen, Jesper; Katajainen, Jyrki; Spork, Maz (2000). "Performance Engineering Case Study: Heap Construction" (PostScript). ACM Journal of Experimental Algorithmics. 5 (15): 15–es. doi:10.1145/351827.384257. S2CID 30995934. Alternate PDF source.
Fleischer, Rudolf (February 1994). "A tight lower bound for the worst case of Bottom-Up-Heapsort" (PDF). Algorithmica. 11 (2): 104–115. doi:10.1007/bf01182770. hdl:11858/00-001M-0000-0014-7B02-C. S2CID 21075180. Archived from the original (PDF) on 14 June 2018. Retrieved 14 June 2018. Also available as Fleischer, Rudolf (April 1991). A tight lower bound for the worst case of Bottom-Up-Heapsort (PDF) (Technical report). MPI-INF. MPI-I-91-104.
Carlsson, Scante (March 1987). "A variant of heapsort with almost optimal number of comparisons" (PDF). Information Processing Letters. 24 (4): 247–250. doi:10.1016/0020-0190(87)90142-6. S2CID 28135103. Archived from the original (PDF) on 27 December 2016.
LaMarca, Anthony; Ladner, Richard E. (April 1999). "The Influence of Caches on the Performance of Sorting" (PDF). Journal of Algorithms. 31 (1): 66–104. doi:10.1006/jagm.1998.0985. S2CID 206567217. See particularly figure 9c on p. 98.
Chen, Jingsen; Edelkamp, Stefan; Elmasry, Amr; Katajainen, Jyrki (27–31 August 2012). "In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses" (PDF). Mathematical Foundations of Computer Science 2012. 37th international conference on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science. Vol. 7464. pp. 259–270. doi:10.1007/978-3-642-32589-2_25. ISBN 978-3-642-32588-5. S2CID 1462216. Archived from the original (PDF) on 29 December 2016. See particularly Fig. 3.
Diekert, Volker; Weiß, Armin (August 2016). "QuickHeapsort: Modifications and improved analysis". Theory of Computing Systems. 59 (2): 209–230. arXiv:1209.4214. doi:10.1007/s00224-015-9656-y. S2CID 792585.

pdfs.semanticscholar.org

Carlsson, Scante (March 1987). "A variant of heapsort with almost optimal number of comparisons" (PDF). Information Processing Letters. 24 (4): 247–250. doi:10.1016/0020-0190(87)90142-6. S2CID 28135103. Archived from the original (PDF) on 27 December 2016.
Chen, Jingsen; Edelkamp, Stefan; Elmasry, Amr; Katajainen, Jyrki (27–31 August 2012). "In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses" (PDF). Mathematical Foundations of Computer Science 2012. 37th international conference on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science. Vol. 7464. pp. 259–270. doi:10.1007/978-3-642-32589-2_25. ISBN 978-3-642-32588-5. S2CID 1462216. Archived from the original (PDF) on 29 December 2016. See particularly Fig. 3.

semanticscholar.org

Bojesen, Jesper; Katajainen, Jyrki; Spork, Maz (2000). "Performance Engineering Case Study: Heap Construction" (PostScript). ACM Journal of Experimental Algorithmics. 5 (15): 15–es. doi:10.1145/351827.384257. S2CID 30995934. Alternate PDF source.

utexas.edu (Global: 868^th place; English: 634^th place)

cs.utexas.edu

Dijkstra, Edsger W. Smoothsort – an alternative to sorting in situ (EWD-796a) (PDF). E.W. Dijkstra Archive. Center for American History, University of Texas at Austin. (transcription)

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

Fleischer, Rudolf (February 1994). "A tight lower bound for the worst case of Bottom-Up-Heapsort" (PDF). Algorithmica. 11 (2): 104–115. doi:10.1007/bf01182770. hdl:11858/00-001M-0000-0014-7B02-C. S2CID 21075180. Archived from the original (PDF) on 14 June 2018. Retrieved 14 June 2018. Also available as Fleischer, Rudolf (April 1991). A tight lower bound for the worst case of Bottom-Up-Heapsort (PDF) (Technical report). MPI-INF. MPI-I-91-104.
Carlsson, Scante (March 1987). "A variant of heapsort with almost optimal number of comparisons" (PDF). Information Processing Letters. 24 (4): 247–250. doi:10.1016/0020-0190(87)90142-6. S2CID 28135103. Archived from the original (PDF) on 27 December 2016.
Chen, Jingsen; Edelkamp, Stefan; Elmasry, Amr; Katajainen, Jyrki (27–31 August 2012). "In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses" (PDF). Mathematical Foundations of Computer Science 2012. 37th international conference on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science. Vol. 7464. pp. 259–270. doi:10.1007/978-3-642-32589-2_25. ISBN 978-3-642-32588-5. S2CID 1462216. Archived from the original (PDF) on 29 December 2016. See particularly Fig. 3.

wikidata.org (Global: 10^th place; English: 98^th place)

Levcopoulos, Christos; Petersson, Ola (1989). "Heapsort—Adapted for Presorted Files". WADS '89: Proceedings of the Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science. Vol. 382. London, UK: Springer-Verlag. pp. 499–509. doi:10.1007/3-540-51542-9_41. ISBN 978-3-540-51542-5. Heapsort—Adapted for presorted files (Q56049336).

zbmath.org (Global: 2,089^th place; English: 1,141^st place)

Cantone, Domenico; Concotti, Gianluca (August 2002). "QuickHeapsort, an efficient mix of classical sorting algorithms" (PDF). Theoretical Computer Science. 285 (1): 25–42. doi:10.1016/S0304-3975(01)00288-2. Zbl 1016.68042.

Heapsort (English Wikipedia)

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

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

auckland.ac.nz (Global: 3,907th place; English: 2,379th place)

cs.auckland.ac.nz

cmu.edu (Global: 2,125th place; English: 1,347th place)

math.cmu.edu

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

dagstuhl.de (Global: low place; English: low place)

drops.dagstuhl.de

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

hjemmesider.diku.dk

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

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

gutech.edu.om (Global: low place; English: low place)

staff.gutech.edu.om

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

inference.org.uk (Global: low place; English: low place)

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

kernel.org (Global: 5,383rd place; English: 3,622nd place)

git.kernel.org

mcgill.ca (Global: 2,445th place; English: 1,513th place)

cgm.cs.mcgill.ca

mpg.de (Global: 1,722nd place; English: 1,710th place)

pubman.mpdl.mpg.de

people.mpi-inf.mpg.de

princeton.edu (Global: 802nd place; English: 528th place)

cs.princeton.edu

researchgate.net (Global: 96th place; English: 89th place)

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

api.semanticscholar.org

pdfs.semanticscholar.org

semanticscholar.org

utexas.edu (Global: 868th place; English: 634th place)

cs.utexas.edu

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

wikidata.org (Global: 10th place; English: 98th place)

zbmath.org (Global: 2,089th place; English: 1,141st place)

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

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

auckland.ac.nz (Global: 3,907^th place; English: 2,379^th place)

cmu.edu (Global: 2,125^th place; English: 1,347^th place)

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

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

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

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

kernel.org (Global: 5,383^rd place; English: 3,622^nd place)

mcgill.ca (Global: 2,445^th place; English: 1,513^th place)

mpg.de (Global: 1,722^nd place; English: 1,710^th place)

princeton.edu (Global: 802^nd place; English: 528^th place)

researchgate.net (Global: 96^th place; English: 89^th place)

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

utexas.edu (Global: 868^th place; English: 634^th place)

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

wikidata.org (Global: 10^th place; English: 98^th place)

zbmath.org (Global: 2,089^th place; English: 1,141^st place)