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.

@article{Hoare01011962, author = {Hoare, C. A. R.}, title = {Quicksort}, journal = {The Computer Journal}, year = {1962}, volume = {5}, number = {1}, pages = {10-16}, url = {http://comjnl.oxfordjournals.org/content/5/1/10.abstract}, doi = {10.1093/comjnl/5.1.10}, keywords = {laufzeit, algorithmen, komplexität, mergesort, quicksort}, abstract = {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.} }

%0 = article %A = Hoare, C. A. R. %D = 1962 %T = Quicksort %U = http://comjnl.oxfordjournals.org/content/5/1/10.abstract

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.

@article{hoare1962quicksort, author = {Hoare, C. A. R.}, title = {Quicksort}, journal = {The Computer Journal}, year = {1962}, volume = {5}, number = {1}, pages = {10-16}, url = {http://comjnl.oxfordjournals.org/content/5/1/10}, keywords = {algorithm, kdesems2013, sorting, quicksort}, abstract = {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. } }

%0 = article %A = Hoare, C. A. R. %D = 1962 %T = Quicksort %U = http://comjnl.oxfordjournals.org/content/5/1/10

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.

@article{Quicksort, author = {Hoare, C. A. R.}, title = {Quicksort}, journal = {The Computer Journal}, year = {1962}, volume = {5}, number = {1}, pages = {10-16}, url = {http://comjnl.oxfordjournals.org/cgi/content/abstract/5/1/10}, doi = {10.1093/comjnl/5.1.10}, keywords = {algorithm, kde, sorting, seminar, quicksort}, abstract = {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. } }

%0 = article %A = Hoare, C. A. R. %D = 1962 %T = Quicksort %U = http://comjnl.oxfordjournals.org/cgi/content/abstract/5/1/10

@misc{hoare1961algorithm, author = {Hoare, C. A. R.}, title = {Algorithm 64: Quicksort.}, journal = {Communications of the ACM}, year = {1961}, volume = {4}, number = {7}, keywords = {Journal} }

%0 = misc %A = Hoare, C. A. R. %B = } %C = %D = 1961 %I = %T = Algorithm 64: Quicksort.} %U =

@article{Hoare1961, author = {Hoare, C. A. R.}, title = {Algorithm 64: Quicksort.}, journal = {Commun. ACM}, year = {1961}, volume = {4}, number = {7}, pages = {321}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b}, keywords = {effiziente, algorithmen, datenstrukturen} }

%0 = article %A = Hoare, C. A. R. %D = 1961 %T = Algorithm 64: Quicksort. %U = http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b

@article{Hoare1961, author = {Hoare, C. A. R.}, title = {Algorithm 64: Quicksort.}, journal = {Commun. ACM}, year = {1961}, volume = {4}, number = {7}, pages = {321}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b}, keywords = {sorting, quicksort, latexkurs} }

%0 = article %A = Hoare, C. A. R. %D = 1961 %T = Algorithm 64: Quicksort. %U = http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b

@article{Hoare1961, author = {Hoare, C. A. R.}, title = {Algorithm 64: Quicksort.}, journal = {Commun. ACM}, year = {1961}, volume = {4}, number = {7}, pages = {321}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b}, keywords = {algorithm, algorithmen, 64, quicksort, latexkurs} }

%0 = article %A = Hoare, C. A. R. %D = 1961 %T = Algorithm 64: Quicksort. %U = http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b

@article{hoare1961algorithm, author = {Hoare, C. A. R.}, title = {Algorithm 64: Quicksort.}, journal = {Commun. ACM}, year = {1961}, volume = {4}, number = {7}, pages = {321}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b}, keywords = {algorithm, sorting, quicksort, latexkurs} }

%0 = article %A = Hoare, C. A. R. %D = 1961 %T = Algorithm 64: Quicksort. %U = http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b

@article{Hoare1961, author = {Hoare, C. A. R.}, title = {Algorithm 64: Quicksort.}, journal = {Commun. ACM}, year = {1961}, volume = {4}, number = {7}, pages = {321}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b}, keywords = {algorithm, sort, quicksort, latexkurs} }

%0 = article %A = Hoare, C. A. R. %D = 1961 %T = Algorithm 64: Quicksort. %U = http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b

@article{Hoare1961, author = {Hoare, C. A. R.}, title = {Algorithm 64: Quicksort.}, journal = {Commun. ACM}, year = {1961}, volume = {4}, number = {7}, pages = {321}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b}, keywords = {quicksort, latexkurs} }

%0 = article %A = Hoare, C. A. R. %D = 1961 %T = Algorithm 64: Quicksort. %U = http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b

@article{Hoare1961, author = {Hoare, C. A. R.}, title = {Algorithm 64: Quicksort.}, journal = {Commun. ACM}, year = {1961}, volume = {4}, number = {7}, pages = {321}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b}, keywords = {algorithmen, quicksort, latexkurs} }

%0 = article %A = Hoare, C. A. R. %D = 1961 %T = Algorithm 64: Quicksort. %U = http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b

@article{Hoare1961, author = {Hoare, C. A. R.}, title = {Algorithm 64: Quicksort.}, journal = {Commun. ACM}, year = {1961}, volume = {4}, number = {7}, pages = {321}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b}, keywords = {latexkurs} }

%0 = article %A = Hoare, C. A. R. %D = 1961 %T = Algorithm 64: Quicksort. %U = http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b

@article{Hoare1961, author = {Hoare, C. A. R.}, title = {Algorithm 64: Quicksort.}, journal = {Commun. ACM}, year = {1961}, volume = {4}, number = {7}, pages = {321}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b}, keywords = {algorithmen, 2013, kde, sorting, seminar, quicksort} }

%0 = article %A = Hoare, C. A. R. %D = 1961 %T = Algorithm 64: Quicksort. %U = http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b

@article{hoare1961algorithm, author = {Hoare, C. A. R.}, title = {Algorithm 64: Quicksort.}, journal = {Commun. ACM}, year = {1961}, volume = {4}, number = {7}, pages = {321}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b}, keywords = {2013, kde, sorting, seminar, quicksort} }

%0 = article %A = Hoare, C. A. R. %D = 1961 %T = Algorithm 64: Quicksort. %U = http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b