Quicksort (English Wikipedia)

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

refsWebsite
Global rank English rank
2nd place
2nd place
11th place
8th place
69th place
59th place
207th place
136th place
1st place
1st place
3rd place
3rd place
5th place
5th place
2,213th place
1,495th place
low place
low place
1,983rd place
1,330th place
2,242nd place
1,513th place
low place
low place
1,185th place
840th place
488th place
374th place
low place
low place
1,997th place
1,295th place
1,564th place
1,028th place
7,788th place
5,521st place
low place
low place
low place
low place
low place
low place
18th place
17th place
244th place
1,325th place
1,514th place
1,024th place
8,599th place
8,200th place
low place
low place
4,539th place
2,858th place
1,174th place
773rd place

acm.org

dl.acm.org

anothercasualcoder.blogspot.com

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 = 210) and on larger instances it suffers from its poor cache behavior (in our experiments more than eight times slower than Quicksort for sorting 228 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

azillionmonkeys.com

books.google.com

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

computerhistory.org

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

danlark.org

dartmouth.edu

cs.dartmouth.edu

doi.org

drdobbs.com

harvard.edu

ui.adsabs.harvard.edu

inference.org.uk

narod.ru

iaroslavski.narod.ru

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

oracle.com

docs.oracle.com

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

psu.edu

citeseerx.ist.psu.edu

citeseer.ist.psu.edu

semanticscholar.org

api.semanticscholar.org

stackexchange.com

cs.stackexchange.com

ubc.ca

ugrad.cs.ubc.ca

uni-kl.de

kluedo.ub.uni-kl.de

uni-lj.si

lusy.fri.uni-lj.si

wardpowers.info

david.wardpowers.info

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