TY - JOUR AU - Hoare, C. A. R. T1 - Quicksort JO - The Computer Journal PY - 1962/ VL - 5 IS - 1 SP - 10 EP - 16 UR - http://comjnl.oxfordjournals.org/content/5/1/10.abstract M3 - 10.1093/comjnl/5.1.10 KW - laufzeit KW - algorithmen KW - komplexität KW - mergesort KW - quicksort L1 - SN - N1 - N1 - AB - A description is given of a new method of sorting in the random-access store of a computer. The method compares very favourably with other known methods in speed, in economy of storage, and in ease of programming. Certain refinements of the method, which may be useful in the optimization of inner loops, are described in the second part of the paper. ER - TY - JOUR AU - Hoare, C. A. R. T1 - Quicksort JO - The Computer Journal PY - 1962/ VL - 5 IS - 1 SP - 10 EP - 16 UR - http://comjnl.oxfordjournals.org/content/5/1/10 M3 - KW - algorithm KW - kdesems2013 KW - sorting KW - quicksort L1 - SN - N1 - N1 - AB - A description is given of a new method of sorting in the random-access store of a computer. The method compares very favourably with other known methods in speed, in economy of storage, and in ease of programming. Certain refinements of the method, which may be useful in the optimization of inner loops, are described in the second part of the paper. ER - TY - JOUR AU - Hoare, C. A. R. T1 - Quicksort JO - The Computer Journal PY - 1962/ VL - 5 IS - 1 SP - 10 EP - 16 UR - http://comjnl.oxfordjournals.org/cgi/content/abstract/5/1/10 M3 - 10.1093/comjnl/5.1.10 KW - algorithm KW - kde KW - sorting KW - seminar KW - quicksort L1 - SN - N1 - Quicksort -- Hoare 5 (1): 10 -- The Computer Journal N1 - AB - A description is given of a new method of sorting in the random-access store of a computer. The method compares very favourably with other known methods in speed, in economy of storage, and in ease of programming. Certain refinements of the method, which may be useful in the optimization of inner loops, are described in the second part of the paper.

ER - TY - GEN AU - Hoare, C. A. R. A2 - T1 - Algorithm 64: Quicksort. JO - Communications of the ACM PB - AD - PY - 1961/7 VL - 4 IS - 7 SP - EP - UR - M3 - KW - Journal L1 - N1 - N1 - AB - ER - TY - JOUR AU - Hoare, C. A. R. T1 - Algorithm 64: Quicksort. JO - Commun. ACM PY - 1961/ VL - 4 IS - 7 SP - EP - UR - http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b M3 - KW - effiziente KW - algorithmen KW - datenstrukturen L1 - SN - N1 - dblp N1 - AB - ER - TY - JOUR AU - Hoare, C. A. R. T1 - Algorithm 64: Quicksort. JO - Commun. ACM PY - 1961/ VL - 4 IS - 7 SP - EP - UR - http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b M3 - KW - sorting KW - quicksort KW - latexkurs L1 - SN - N1 - dblp N1 - AB - ER - TY - JOUR AU - Hoare, C. A. R. T1 - Algorithm 64: Quicksort. JO - Commun. ACM PY - 1961/ VL - 4 IS - 7 SP - EP - UR - http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b M3 - KW - algorithm KW - algorithmen KW - 64 KW - quicksort KW - latexkurs L1 - SN - N1 - dblp N1 - AB - ER - TY - JOUR AU - Hoare, C. A. R. T1 - Algorithm 64: Quicksort. JO - Commun. ACM PY - 1961/ VL - 4 IS - 7 SP - EP - UR - http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b M3 - KW - algorithm KW - sorting KW - quicksort KW - latexkurs L1 - SN - N1 - dblp N1 - AB - ER - TY - JOUR AU - Hoare, C. A. R. T1 - Algorithm 64: Quicksort. JO - Commun. ACM PY - 1961/ VL - 4 IS - 7 SP - EP - UR - http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b M3 - KW - algorithm KW - sort KW - quicksort KW - latexkurs L1 - SN - N1 - dblp N1 - AB - ER - TY - JOUR AU - Hoare, C. A. R. T1 - Algorithm 64: Quicksort. JO - Commun. ACM PY - 1961/ VL - 4 IS - 7 SP - EP - UR - http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b M3 - KW - quicksort KW - latexkurs L1 - SN - N1 - dblp N1 - AB - ER - TY - JOUR AU - Hoare, C. A. R. T1 - Algorithm 64: Quicksort. JO - Commun. ACM PY - 1961/ VL - 4 IS - 7 SP - EP - UR - http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b M3 - KW - algorithmen KW - quicksort KW - latexkurs L1 - SN - N1 - dblp N1 - AB - ER - TY - JOUR AU - Hoare, C. A. R. T1 - Algorithm 64: Quicksort. JO - Commun. ACM PY - 1961/ VL - 4 IS - 7 SP - EP - UR - http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b M3 - KW - latexkurs L1 - SN - N1 - dblp N1 - AB - ER - TY - JOUR AU - Hoare, C. A. R. T1 - Algorithm 64: Quicksort. JO - Commun. ACM PY - 1961/ VL - 4 IS - 7 SP - EP - UR - http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b M3 - KW - algorithmen KW - 2013 KW - kde KW - sorting KW - seminar KW - quicksort L1 - SN - N1 - dblp N1 - AB - ER - TY - JOUR AU - Hoare, C. A. R. T1 - Algorithm 64: Quicksort. JO - Commun. ACM PY - 1961/ VL - 4 IS - 7 SP - EP - UR - http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b M3 - KW - 2013 KW - kde KW - sorting KW - seminar KW - quicksort L1 - SN - N1 - dblp N1 - AB - ER -