Kvikksortering (Norwegian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Kvikksortering" in Norwegian language version.

refsWebsite

Global rank Norwegian rank

4acm.org

1,185^th place

1,389^th place

2google.no

9,052^nd place

57^th place

1snl.no

667^th place

5^th place

1hioa.no

low place

805^th place

1instructure.com

low place

1computerhistory.org

2,213^th place

6,801^st place

1codeblab.com

low place

1anothercasualcoder.blogspot.com

low place

1tuhs.org

low place

1siam.org

low place

1stackexchange.com

1,983^rd place

2,780^th place

1uni-kl.de

low place

1oup.com

485^th place

429^th place

1doi.org

2^nd place

9^th place

1or.cz

low place

1sciencedirect.com

149^th place

236^th place

1cmu.edu

1,564^th place

3,188^th place

1drdobbs.com

7,788^th place

low place

1web.archive.org

1^st place

1semanticscholar.org

11^th place

1,012^th place

acm.org

dl.acm.org

Hoare 1961 Hoare, C. A. R., Elliott brothers Ltd., Hertfordshire, England, U.K. (1961). Algorithm 64: Quicksort. Communications of the ACM, Volume 4, Issue 7, New York, juli 1961. s. 321. doi 10.1145/366622.366644.
Sedgewick 1978 Sedgewick, Robert (1978). Implementing Quicksort programs. Communications of the ACM, Volume 21, Issue 10, New York, oktober 1978. s. 847-857. doi:10.1145/359619.359631.

doi.acm.org

van Emden 1970 van Emden, Maarten H.; Mathematical Center, Amsterdam, Nederland (1970). Algorithms 402: Increasing the Efficiency of Quicksort. Communications of the ACM, Volume 13, Issue 11, New York, november 1970. s. 693-694. doi:10.1145/362790.362803, ISSN 0001-0782.
Hacker News 1999 Hacker News (1999). Potential Quicksort replacement in java.util.Arrays with new Dual-Pivot. doi.acm.org, Hacker News, oktober 1999.

anothercasualcoder.blogspot.com

DeBarros 2015 De Barros, Marcelo M. (2015). My Quickshort interview with Sir Tony Hoare, the inventor of Quicksort. anothercasualcoder.blogspot.com, blogg, 15. mars 2015.

cmu.edu

cs.cmu.edu

Acar 2013 Acar, Umut A.; Blelloch, Guy E.; Reid-Miller, Margaret; Tangwongsan, Kanat (2013). Quicksort and Sorting Lower Bounds (PDF). Parallel and Sequential Data Structures and Algorithms, 15-210, våren 2013.

codeblab.com

Jaroslavskij 2009 Jaroslavskij, Vladimir (2009). Dual-Pivot Quicksort (PDF). 6. februar 2009.

computerhistory.org

Computer History Museum 2017 Computer History Museum (2017). Sir Antony Hoare. 2006 Fellow, Hall of Fellows, 2017, besøkt 30. januar 2017.

doi.org

Hoare 1962 Hoare, C. A. R. (1962). Quicksort. The Computer Journal, Volume 5, Issue 1, Oxford, 1. januar 1962. s. 10-16. DOI: https://doi.org/10.1093/comjnl/5.1.10.

drdobbs.com

Breshears 2012 Breshears, Clay (2012). Quicksort Partition via Prefix Scan. Dr. Dobb’s Journal. The World of Software Development, 2. juli 2012.

google.no

books.google.no

Skiena 2008, side 129 Skiena, Steven Sol (2008). The Algorithm Design Manual. Springer Publishing; 2. utgave, 26. juli 2008. ISBN 1 8480 0069 3. ISBN 978 1 84800 069 8.
Miller 2000 Miller, Russ; Boxer, Laurence (2000). Algorithms sequential & parallel: a unified approach. Prentice Hall, 2000. ISBN 0 1308 6373 4. ISBN 978 0 13 086373 7.

hioa.no

cs.hioa.no

«Algoritmer og datastrukturer - Kapittel 1 – ». www.cs.hioa.no. Besøkt 3. mars 2023.

instructure.com

hvl.instructure.com

«Algoritmer og datastrukturer - Kapittel 1».

or.cz

repo.or.cz

GNU C 2017 GNU C (2017). qsort. GNU C Library (glibc), 2017, besøkt 1. februar 2017.

oup.com

academic.oup.com

Hoare 1962 Hoare, C. A. R. (1962). Quicksort. The Computer Journal, Volume 5, Issue 1, Oxford, 1. januar 1962. s. 10-16. DOI: https://doi.org/10.1093/comjnl/5.1.10.

sciencedirect.com

LaMarca 1999 LaMarca, Anthony; Ladner, Richard E.;Xerox PARC, 3333 Coyote Hill Road, Palo Alto, California, 94304 (1999). The Influence of Caches on the Performance of Sorting. Journal of Algorithms, Volume 31, Issue 1, April 1999. s. 66–104. doi:10.1006/jagm.1998.0985.

semanticscholar.org

pdfs.semanticscholar.org

Powers 1991 Powers, David M. W. (1991). Parallelized Quicksort and Radixsort with Optimal Speedup (PDF). Proceedings of the International Conference on Parallel on Parallel Computing Technologies, Universität Kaiserslautern, Kaiserslautern, Vest-Tyskland, 1991. Arkivert fra originalen (PDF) 3. februar 2017. Besøkt 2. februar 2017.

siam.org

epubs.siam.org

Wild 2013 Wild, Sebastian; Nebel, Markus; Reitzig, Raphael; Laube, Ulrich (2013). Engineering Java 7's Dual Pivot Quicksort Using MaLiJAn*: Adventures with Just-In-Time Compilation. 2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Society for Industrial and Applied Mathematics (SIAM); 7. januar 2013. s. 55–69, doi: 10.1137/1.9781611972931.5. ISBN 978 1 61197 253 5. ISBN 978 1 61197 293 1.

snl.no

Drange, Pål Grønås (27. januar 2023). «sorteringsalgoritme». Store norske leksikon (på norsk). Besøkt 3. mars 2023.

stackexchange.com

cs.stackexchange.com

Computer Science 2017 Computer Science (2017). Quicksort Partitioning: Hoare vs. Lomuto. besøkt 31. januar 2017.

tuhs.org

minnie.tuhs.org

Bell 1972 Bell Laboratories (1972). QSORT (III). V3/man/man3/qsort3, UNIX Programmer's Manual, Third Edition, 6. desember 1972.

uni-kl.de

kluedo.ub.uni-kl.de

Wild 2012 Wild, Sebastian (2012). Engineering Java 7's Java 7's Dual Pivot Quicksort. Technische Universität Kaiserslautern, KLUEDO, 2012. doi: 10.1137/1.9781611972931.5.

web.archive.org

Powers 1991 Powers, David M. W. (1991). Parallelized Quicksort and Radixsort with Optimal Speedup (PDF). Proceedings of the International Conference on Parallel on Parallel Computing Technologies, Universität Kaiserslautern, Kaiserslautern, Vest-Tyskland, 1991. Arkivert fra originalen (PDF) 3. februar 2017. Besøkt 2. februar 2017.