Quicksort (English Wikipedia)

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

refsWebsite

Global rank English rank

14doi.org

2^nd place

8semanticscholar.org

11^th place

8^th place

4arxiv.org

69^th place

59^th place

4psu.edu

207^th place

136^th place

3web.archive.org

1^st place

3books.google.com

3^rd place

2worldcat.org

5^th place

1computerhistory.org

2,213^th place

1,495^th place

1anothercasualcoder.blogspot.com

low place

1stackexchange.com

1,983^rd place

1,330^th place

1dartmouth.edu

2,242^nd place

1,513^th place

1uni-kl.de

low place

1acm.org

1,185^th place

840^th place

1columbia.edu

488^th place

374^th place

1or.cz

low place

1ubc.ca

1,997^th place

1,295^th place

1cmu.edu

1,564^th place

1,028^th place

1drdobbs.com

7,788^th place

5,521^st place

1azillionmonkeys.com

low place

1inference.org.uk

low place

1danlark.org

low place

1harvard.edu

18^th place

17^th place

1narod.ru

244^th place

1,325^th place

1oracle.com

1,514^th place

1,024^th place

1uni-lj.si

8,599^th place

8,200^th place

1wardpowers.info

low place

1auckland.ac.nz

4,539^th place

2,858^th place

1nyu.edu

1,174^th place

773^rd place

acm.org

dl.acm.org

Chandramouli, Badrish; Goldstein, Jonathan (18 June 2014). "Patience is a virtue". Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. Sigmod '14. Snowbird Utah USA: ACM. pp. 731–742. doi:10.1145/2588555.2593662. ISBN 978-1-4503-2376-5. S2CID 7830071.

anothercasualcoder.blogspot.com

"My Quickshort interview with Sir Tony Hoare, the inventor of Quicksort". Marcelo M De Barros. 15 March 2015.

arxiv.org

Edelkamp, Stefan; Weiß, Armin (7–8 January 2019). Worst-Case Efficient Sorting with QuickMergesort. ALENEX 2019: 21st Workshop on Algorithm Engineering and Experiments. San Diego. arXiv:1811.99833. doi:10.1137/1.9781611975499.1. ISBN 978-1-61197-549-9. on small instances Heapsort is already considerably slower than Quicksort (in our experiments more than 30% for n = 2¹⁰) and on larger instances it suffers from its poor cache behavior (in our experiments more than eight times slower than Quicksort for sorting 2²⁸ elements).
Wild, Sebastian; Nebel, Markus E. (2012). Average case analysis of Java 7's dual pivot quicksort. European Symposium on Algorithms. arXiv:1310.7409. Bibcode:2013arXiv1310.7409W.
Wild, Sebastian (3 November 2015). "Why Is Dual-Pivot Quicksort Fast?". arXiv:1511.01138 [cs.DS].
Edelkamp, Stefan; Weiß, Armin (22 April 2016). "BlockQuicksort: How Branch Mispredictions don't affect Quicksort". arXiv:1604.06697 [cs.DS].

auckland.ac.nz

cs.auckland.ac.nz

Kaligosi, Kanela; Sanders, Peter (11–13 September 2006). How Branch Mispredictions Affect Quicksort (PDF). ESA 2006: 14th Annual European Symposium on Algorithms. Zurich. doi:10.1007/11841036_69.

azillionmonkeys.com

Hsieh, Paul (2004). "Sorting revisited". azillionmonkeys.com.

books.google.com

Skiena, Steven S. (2008). The Algorithm Design Manual. Springer. p. 129. ISBN 978-1-84800-069-8.
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.
Miller, Russ; Boxer, Laurence (2000). Algorithms sequential & parallel: a unified approach. Prentice Hall. ISBN 978-0-13-086373-7.

cmu.edu

cs.cmu.edu

Umut A. Acar, Guy E Blelloch, Margaret Reid-Miller, and Kanat Tangwongsan, Quicksort and Sorting Lower Bounds, Parallel and Sequential Data Structures and Algorithms. 2013.

columbia.edu

cs.columbia.edu

qsort.c in GNU libc: [1], [2]

computerhistory.org

"Sir Antony Hoare". Computer History Museum. Archived from the original on 3 April 2015. Retrieved 22 April 2015.

danlark.org

Kutenin, Danila (20 April 2022). "Changing std::sort at Google's Scale and Beyond". Experimental chill.

dartmouth.edu

cs.dartmouth.edu

McIlroy, M. D. (10 April 1999). "A killer adversary for quicksort" (PDF). Software: Practice and Experience. 29 (4): 341–344. doi:10.1002/(SICI)1097-024X(19990410)29:4<341::AID-SPE237>3.0.CO;2-R. S2CID 35935409.

doi.org

Hoare, C. A. R. (1961). "Algorithm 64: Quicksort". Comm. ACM. 4 (7): 321. doi:10.1145/366622.366644.
Shustek, L. (2009). "Interview: An interview with C.A.R. Hoare". Comm. ACM. 52 (3): 38–41. doi:10.1145/1467247.1467261. S2CID 1868477.
Bentley, Jon L.; McIlroy, M. Douglas (1993). "Engineering a sort function". Software: Practice and Experience. 23 (11): 1249–1265. CiteSeerX 10.1.1.14.8162. doi:10.1002/spe.4380231105. S2CID 8822797.
Van Emden, M. H. (1 November 1970). "Algorithms 402: Increasing the Efficiency of Quicksort". Commun. ACM. 13 (11): 693–694. doi:10.1145/362790.362803. ISSN 0001-0782. S2CID 4774719.
McIlroy, M. D. (10 April 1999). "A killer adversary for quicksort" (PDF). Software: Practice and Experience. 29 (4): 341–344. doi:10.1002/(SICI)1097-024X(19990410)29:4<341::AID-SPE237>3.0.CO;2-R. S2CID 35935409.
Hoare, C. A. R. (1 January 1962). "Quicksort". The Computer Journal. 5 (1): 10–16. doi:10.1093/comjnl/5.1.10. ISSN 0010-4620.
Chandramouli, Badrish; Goldstein, Jonathan (18 June 2014). "Patience is a virtue". Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. Sigmod '14. Snowbird Utah USA: ACM. pp. 731–742. doi:10.1145/2588555.2593662. ISBN 978-1-4503-2376-5. S2CID 7830071.
Sedgewick, R. (1978). "Implementing Quicksort programs". Comm. ACM. 21 (10): 847–857. doi:10.1145/359619.359631. S2CID 10020756.
LaMarca, Anthony; Ladner, Richard E. (1999). "The Influence of Caches on the Performance of Sorting". Journal of Algorithms. 31 (1): 66–104. CiteSeerX 10.1.1.27.1788. doi:10.1006/jagm.1998.0985. S2CID 206567217. Although saving small subarrays until the end makes sense from an instruction count perspective, it is exactly the wrong thing to do from a cache performance perspective.
Edelkamp, Stefan; Weiß, Armin (7–8 January 2019). Worst-Case Efficient Sorting with QuickMergesort. ALENEX 2019: 21st Workshop on Algorithm Engineering and Experiments. San Diego. arXiv:1811.99833. doi:10.1137/1.9781611975499.1. ISBN 978-1-61197-549-9. on small instances Heapsort is already considerably slower than Quicksort (in our experiments more than 30% for n = 2¹⁰) and on larger instances it suffers from its poor cache behavior (in our experiments more than eight times slower than Quicksort for sorting 2²⁸ elements).
Wild, S.; Nebel, M.; Reitzig, R.; Laube, U. (7 January 2013). Engineering Java 7's Dual Pivot Quicksort Using MaLiJAn. Proceedings. Society for Industrial and Applied Mathematics. pp. 55–69. doi:10.1137/1.9781611972931.5. ISBN 978-1-61197-253-5.
Kushagra, Shrinu; López-Ortiz, Alejandro; Qiao, Aurick; Munro, J. Ian (2014). Multi-Pivot Quicksort: Theory and Experiments. Proc. Workshop on Algorithm Engineering and Experiments (ALENEX). doi:10.1137/1.9781611973198.6.
Motzkin, D.; Hansen, C.L. (1982), "An efficient external sorting with minimal space requirement", International Journal of Computer and Information Sciences, 11 (6): 381–396, doi:10.1007/BF00996816, S2CID 6829805
Kaligosi, Kanela; Sanders, Peter (11–13 September 2006). How Branch Mispredictions Affect Quicksort (PDF). ESA 2006: 14th Annual European Symposium on Algorithms. Zurich. doi:10.1007/11841036_69.

drdobbs.com

Breshears, Clay (2012). "Quicksort Partition via Prefix Scan". Dr. Dobb's.

harvard.edu

ui.adsabs.harvard.edu

Wild, Sebastian; Nebel, Markus E. (2012). Average case analysis of Java 7's dual pivot quicksort. European Symposium on Algorithms. arXiv:1310.7409. Bibcode:2013arXiv1310.7409W.

inference.org.uk

MacKay, David (December 2005). "Heapsort, Quicksort, and Entropy". Archived from the original on 1 April 2009.

narod.ru

iaroslavski.narod.ru

Yaroslavskiy, Vladimir (2009). "Dual-Pivot Quicksort" (PDF). Archived from the original (PDF) on 2 October 2015.

nyu.edu

cs.nyu.edu

Richard Cole, David C. Kandathil: "The average case analysis of Partition sorts", European Symposium on Algorithms, 14–17 September 2004, Bergen, Norway. Published: Lecture Notes in Computer Science 3221, Springer Verlag, pp. 240–251.

or.cz

repo.or.cz

qsort.c in GNU libc: [1], [2]

oracle.com

docs.oracle.com

"Arrays". Java Platform SE 7. Oracle. Retrieved 4 September 2014.

psu.edu

citeseerx.ist.psu.edu

Bentley, Jon L.; McIlroy, M. Douglas (1993). "Engineering a sort function". Software: Practice and Experience. 23 (11): 1249–1265. CiteSeerX 10.1.1.14.8162. doi:10.1002/spe.4380231105. S2CID 8822797.
LaMarca, Anthony; Ladner, Richard E. (1999). "The Influence of Caches on the Performance of Sorting". Journal of Algorithms. 31 (1): 66–104. CiteSeerX 10.1.1.27.1788. doi:10.1006/jagm.1998.0985. S2CID 206567217. Although saving small subarrays until the end makes sense from an instruction count perspective, it is exactly the wrong thing to do from a cache performance perspective.
Powers, David M. W. (1991). Parallelized Quicksort and Radixsort with Optimal Speedup. Proc. Int'l Conf. on Parallel Computing Technologies. CiteSeerX 10.1.1.57.9071.

citeseer.ist.psu.edu

Bentley, Jon L.; McIlroy, M. Douglas (1993). "Engineering a sort function". Software: Practice and Experience. 23 (11): 1249–1265. CiteSeerX 10.1.1.14.8162. doi:10.1002/spe.4380231105. S2CID 8822797.

semanticscholar.org

api.semanticscholar.org

Shustek, L. (2009). "Interview: An interview with C.A.R. Hoare". Comm. ACM. 52 (3): 38–41. doi:10.1145/1467247.1467261. S2CID 1868477.
Bentley, Jon L.; McIlroy, M. Douglas (1993). "Engineering a sort function". Software: Practice and Experience. 23 (11): 1249–1265. CiteSeerX 10.1.1.14.8162. doi:10.1002/spe.4380231105. S2CID 8822797.
Van Emden, M. H. (1 November 1970). "Algorithms 402: Increasing the Efficiency of Quicksort". Commun. ACM. 13 (11): 693–694. doi:10.1145/362790.362803. ISSN 0001-0782. S2CID 4774719.
McIlroy, M. D. (10 April 1999). "A killer adversary for quicksort" (PDF). Software: Practice and Experience. 29 (4): 341–344. doi:10.1002/(SICI)1097-024X(19990410)29:4<341::AID-SPE237>3.0.CO;2-R. S2CID 35935409.
Chandramouli, Badrish; Goldstein, Jonathan (18 June 2014). "Patience is a virtue". Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. Sigmod '14. Snowbird Utah USA: ACM. pp. 731–742. doi:10.1145/2588555.2593662. ISBN 978-1-4503-2376-5. S2CID 7830071.
Sedgewick, R. (1978). "Implementing Quicksort programs". Comm. ACM. 21 (10): 847–857. doi:10.1145/359619.359631. S2CID 10020756.
LaMarca, Anthony; Ladner, Richard E. (1999). "The Influence of Caches on the Performance of Sorting". Journal of Algorithms. 31 (1): 66–104. CiteSeerX 10.1.1.27.1788. doi:10.1006/jagm.1998.0985. S2CID 206567217. Although saving small subarrays until the end makes sense from an instruction count perspective, it is exactly the wrong thing to do from a cache performance perspective.
Motzkin, D.; Hansen, C.L. (1982), "An efficient external sorting with minimal space requirement", International Journal of Computer and Information Sciences, 11 (6): 381–396, doi:10.1007/BF00996816, S2CID 6829805

stackexchange.com

cs.stackexchange.com

"Quicksort Partitioning: Hoare vs. Lomuto". cs.stackexchange.com. Retrieved 3 August 2015.

ubc.ca

ugrad.cs.ubc.ca

http://www.ugrad.cs.ubc.ca/~cs260/chnotes/ch6/Ch6CovCompiled.html^{[permanent dead link]}

uni-kl.de

kluedo.ub.uni-kl.de

Wild, Sebastian (2012). Java 7's Dual Pivot Quicksort (Thesis). Technische Universität Kaiserslautern.

uni-lj.si

lusy.fri.uni-lj.si

Kushagra, Shrinu; López-Ortiz, Alejandro; Munro, J. Ian; Qiao, Aurick (7 February 2014). Multi-Pivot Quicksort: Theory and Experiments (PDF) (Seminar presentation). Waterloo, Ontario.

wardpowers.info

david.wardpowers.info

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

web.archive.org

"Sir Antony Hoare". Computer History Museum. Archived from the original on 3 April 2015. Retrieved 22 April 2015.
MacKay, David (December 2005). "Heapsort, Quicksort, and Entropy". Archived from the original on 1 April 2009.
Yaroslavskiy, Vladimir (2009). "Dual-Pivot Quicksort" (PDF). Archived from the original (PDF) on 2 October 2015.

worldcat.org

search.worldcat.org

Van Emden, M. H. (1 November 1970). "Algorithms 402: Increasing the Efficiency of Quicksort". Commun. ACM. 13 (11): 693–694. doi:10.1145/362790.362803. ISSN 0001-0782. S2CID 4774719.
Hoare, C. A. R. (1 January 1962). "Quicksort". The Computer Journal. 5 (1): 10–16. doi:10.1093/comjnl/5.1.10. ISSN 0010-4620.