Quicksort (Basque Wikipedia)

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

refsWebsite

Global rank Basque rank

7doi.org

2^nd place

6^th place

6worldcat.org

5^th place

1^st place

3nih.gov

4^th place

5^th place

3acm.org

1,185^th place

460^th place

2web.archive.org

1^st place

2^nd place

2stackexchange.com

1,983^rd place

852^nd place

1inguma.eus

low place

70^th place

1anothercasualcoder.blogspot.com

low place

1wiley.com

222^nd place

58^th place

1oracle.com

1,514^th place

1,897^th place

1siam.org

low place

1oup.com

485^th place

169^th place

acm.org

portal.acm.org

Hoare, C. A. R.. (1961-07-01). «Algorithm 64: Quicksort» Communications of the ACM 4 (7): 321. doi:10.1145/366622.366644. (Noiz kontsultatua: 2020-06-07).
van Emden, M. H.. (1970-11-01). «Algorithms 402: Increasing the efficiency of quicksort» Communications of the ACM 13 (11): 693–694. doi:10.1145/362790.362803. (Noiz kontsultatua: 2020-06-07).

dl.acm.org

(Ingelesez) Shustek, Len; Hoare, C.A.R.. (2009-03). «InterviewAn interview with C.A.R. Hoare» Communications of the ACM 52 (3): 38–41. doi:10.1145/1467247.1467261. ISSN 0001-0782. (Noiz kontsultatua: 2020-06-07).

anothercasualcoder.blogspot.com

«My Quickshort interview with Sir Tony Hoare, the inventor of Quicksort» My Quickshort interview with Sir Tony Hoare, the inventor of Quicksort (Noiz kontsultatua: 2020-06-07).

doi.org

dx.doi.org

Hoare, C. A. R.. (1961-07-01). «Algorithm 64: Quicksort» Communications of the ACM 4 (7): 321. doi:10.1145/366622.366644. (Noiz kontsultatua: 2020-06-07).
(Ingelesez) Shustek, Len; Hoare, C.A.R.. (2009-03). «InterviewAn interview with C.A.R. Hoare» Communications of the ACM 52 (3): 38–41. doi:10.1145/1467247.1467261. ISSN 0001-0782. (Noiz kontsultatua: 2020-06-07).
(Ingelesez) Bentley, Jon L.; McIlroy, M. Douglas. (1993-11). «Engineering a sort function» Software: Practice and Experience 23 (11): 1249–1265. doi:10.1002/spe.4380231105. (Noiz kontsultatua: 2020-06-07).
van Emden, M. H.. (1970-11-01). «Algorithms 402: Increasing the efficiency of quicksort» Communications of the ACM 13 (11): 693–694. doi:10.1145/362790.362803. (Noiz kontsultatua: 2020-06-07).
(Ingelesez) Wild, Sebastian; Nebel, Markus; Reitzig, Raphael; Laube, Ulrich. (2013-01-07). Sanders, Peter ed. «Engineering Java 7's Dual Pivot Quicksort Using MaLiJAn» 2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Society for Industrial and Applied Mathematics): 55–69. doi:10.1137/1.9781611972931.5.. ISBN 978-1-61197-253-5. (Noiz kontsultatua: 2020-06-07).
Bentley, Jon. (1985-06-01). «Programming pearls» Communications of the ACM 28 (6): 570–576. doi:10.1145/3812.315108. ISSN 0001-0782. (Noiz kontsultatua: 2020-06-07).
(Ingelesez) Hoare, C. A. R.. (1962-01-01). «Quicksort» The Computer Journal 5 (1): 10–16. doi:10.1093/comjnl/5.1.10. ISSN 0010-4620. (Noiz kontsultatua: 2020-06-07).

inguma.eus

Santos, Rosa Arruabarrena. (1997). Algoritmika. UEU arg ISBN 978-84-86967-81-9. (Noiz kontsultatua: 2020-06-07).

nih.gov

pubmedcentral.nih.gov

Skiena, Steven S.. (2008). The algorithm design manual. (2nd ed. argitaraldia) Springer ISBN 978-1-84800-070-4. PMC 370729337. (Noiz kontsultatua: 2020-06-07).
Beautiful code. O'Reilly 2007 ISBN 978-0-596-51004-6. PMC 163289538. (Noiz kontsultatua: 2020-06-07).
Introduction to algorithms. (Third edition. argitaraldia) MIT Press 2009 ISBN 978-0-262-27083-0. PMC 676697295. (Noiz kontsultatua: 2020-06-07).

oracle.com

docs.oracle.com

«Arrays (Java Platform SE 7 )» docs.oracle.com (Noiz kontsultatua: 2020-06-07).

oup.com

academic.oup.com

(Ingelesez) Hoare, C. A. R.. (1962-01-01). «Quicksort» The Computer Journal 5 (1): 10–16. doi:10.1093/comjnl/5.1.10. ISSN 0010-4620. (Noiz kontsultatua: 2020-06-07).

siam.org

epubs.siam.org

(Ingelesez) Wild, Sebastian; Nebel, Markus; Reitzig, Raphael; Laube, Ulrich. (2013-01-07). Sanders, Peter ed. «Engineering Java 7's Dual Pivot Quicksort Using MaLiJAn» 2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Society for Industrial and Applied Mathematics): 55–69. doi:10.1137/1.9781611972931.5.. ISBN 978-1-61197-253-5. (Noiz kontsultatua: 2020-06-07).

stackexchange.com

cs.stackexchange.com

«algorithms - Quicksort Partitioning: Hoare vs. Lomuto» Computer Science Stack Exchange (Noiz kontsultatua: 2020-06-07).
«algorithms - Quicksort Partitioning: Hoare vs. Lomuto» Computer Science Stack Exchange (Noiz kontsultatua: 2020-06-07).

web.archive.org

«Sir Antony Hoare | Computer History Museum» web.archive.org 2015-04-03 (Noiz kontsultatua: 2020-06-07).
«Wayback Machine» web.archive.org 2015-10-02 (Noiz kontsultatua: 2020-06-07).

wiley.com

doi.wiley.com

(Ingelesez) Bentley, Jon L.; McIlroy, M. Douglas. (1993-11). «Engineering a sort function» Software: Practice and Experience 23 (11): 1249–1265. doi:10.1002/spe.4380231105. (Noiz kontsultatua: 2020-06-07).

worldcat.org

Skiena, Steven S.. (2008). The algorithm design manual. (2nd ed. argitaraldia) Springer ISBN 978-1-84800-070-4. PMC 370729337. (Noiz kontsultatua: 2020-06-07).
(Ingelesez) Shustek, Len; Hoare, C.A.R.. (2009-03). «InterviewAn interview with C.A.R. Hoare» Communications of the ACM 52 (3): 38–41. doi:10.1145/1467247.1467261. ISSN 0001-0782. (Noiz kontsultatua: 2020-06-07).
Beautiful code. O'Reilly 2007 ISBN 978-0-596-51004-6. PMC 163289538. (Noiz kontsultatua: 2020-06-07).
Bentley, Jon. (1985-06-01). «Programming pearls» Communications of the ACM 28 (6): 570–576. doi:10.1145/3812.315108. ISSN 0001-0782. (Noiz kontsultatua: 2020-06-07).
Introduction to algorithms. (Third edition. argitaraldia) MIT Press 2009 ISBN 978-0-262-27083-0. PMC 676697295. (Noiz kontsultatua: 2020-06-07).
(Ingelesez) Hoare, C. A. R.. (1962-01-01). «Quicksort» The Computer Journal 5 (1): 10–16. doi:10.1093/comjnl/5.1.10. ISSN 0010-4620. (Noiz kontsultatua: 2020-06-07).