PUMA publications for /author/C.%20A.%20R.%20Hoarehttps://puma.uni-kassel.de/author/C.%20A.%20R.%20HoarePUMA RSS feed for /author/C.%20A.%20R.%20Hoare2024-03-29T02:24:00+01:00Algorithm 64: Quicksort.https://puma.uni-kassel.de/bibtex/21b8a512e0042a453e6ceaf5a46aaaa2b/03488284034882842014-07-06T10:15:22+02:00Journal <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="C. A. R. Hoare" itemprop="url" href="/author/C.%20A.%20R.%20Hoare"><span itemprop="name">C. Hoare</span></a></span>. </span>(<em><span>Juli 1961<meta content="Juli 1961" itemprop="datePublished"/></span></em>)Sun Jul 06 10:15:22 CEST 2014Communications of the ACM77Algorithm 64: Quicksort.41961Journal Algorithm 64: Quicksort.https://puma.uni-kassel.de/bibtex/21b58ff39c1c545c2be8114935d3c757d/chbaslerchbasler2014-06-20T17:56:58+02:00effiziente algorithmen datenstrukturen <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="C. A. R. Hoare" itemprop="url" href="/author/C.%20A.%20R.%20Hoare"><span itemprop="name">C. Hoare</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Commun. ACM</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">4 </span></span>(<span itemprop="issueNumber">7</span>):
<span itemprop="pagination">321</span></em> </span>(<em><span>1961<meta content="1961" itemprop="datePublished"/></span></em>)Fri Jun 20 17:56:58 CEST 2014Commun. ACM7321Algorithm 64: Quicksort.41961effiziente algorithmen datenstrukturen dblpAlgorithm 64: Quicksort.https://puma.uni-kassel.de/bibtex/21b58ff39c1c545c2be8114935d3c757d/uk015704uk0157042014-01-28T08:53:08+01:00sorting quicksort latexkurs <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="C. A. R. Hoare" itemprop="url" href="/author/C.%20A.%20R.%20Hoare"><span itemprop="name">C. Hoare</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Commun. ACM</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">4 </span></span>(<span itemprop="issueNumber">7</span>):
<span itemprop="pagination">321</span></em> </span>(<em><span>1961<meta content="1961" itemprop="datePublished"/></span></em>)Tue Jan 28 08:53:08 CET 2014Commun. ACM7321Algorithm 64: Quicksort.41961sorting quicksort latexkurs dblpAlgorithm 64: Quicksort.https://puma.uni-kassel.de/bibtex/21b58ff39c1c545c2be8114935d3c757d/mvmv2014-01-28T08:53:07+01:00algorithm algorithmen 64 quicksort latexkurs <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="C. A. R. Hoare" itemprop="url" href="/author/C.%20A.%20R.%20Hoare"><span itemprop="name">C. Hoare</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Commun. ACM</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">4 </span></span>(<span itemprop="issueNumber">7</span>):
<span itemprop="pagination">321</span></em> </span>(<em><span>1961<meta content="1961" itemprop="datePublished"/></span></em>)Tue Jan 28 08:53:07 CET 2014Commun. ACM7321Algorithm 64: Quicksort.41961algorithm algorithmen 64 quicksort latexkurs dblpAlgorithm 64: Quicksort.https://puma.uni-kassel.de/bibtex/21b58ff39c1c545c2be8114935d3c757d/usern1usern12014-01-28T08:52:43+01:00algorithm sorting quicksort latexkurs <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="C. A. R. Hoare" itemprop="url" href="/author/C.%20A.%20R.%20Hoare"><span itemprop="name">C. Hoare</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Commun. ACM</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">4 </span></span>(<span itemprop="issueNumber">7</span>):
<span itemprop="pagination">321</span></em> </span>(<em><span>1961<meta content="1961" itemprop="datePublished"/></span></em>)Tue Jan 28 08:52:43 CET 2014Commun. ACM7321Algorithm 64: Quicksort.41961algorithm sorting quicksort latexkurs dblpAlgorithm 64: Quicksort.https://puma.uni-kassel.de/bibtex/21b58ff39c1c545c2be8114935d3c757d/sergejbratsergejbrat2014-01-28T08:52:43+01:00algorithm sort quicksort latexkurs <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="C. A. R. Hoare" itemprop="url" href="/author/C.%20A.%20R.%20Hoare"><span itemprop="name">C. Hoare</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Commun. ACM</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">4 </span></span>(<span itemprop="issueNumber">7</span>):
<span itemprop="pagination">321</span></em> </span>(<em><span>1961<meta content="1961" itemprop="datePublished"/></span></em>)Tue Jan 28 08:52:43 CET 2014Commun. ACM7321Algorithm 64: Quicksort.41961algorithm sort quicksort latexkurs dblpAlgorithm 64: Quicksort.https://puma.uni-kassel.de/bibtex/21b58ff39c1c545c2be8114935d3c757d/todetode2014-01-28T08:52:43+01:00quicksort latexkurs <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="C. A. R. Hoare" itemprop="url" href="/author/C.%20A.%20R.%20Hoare"><span itemprop="name">C. Hoare</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Commun. ACM</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">4 </span></span>(<span itemprop="issueNumber">7</span>):
<span itemprop="pagination">321</span></em> </span>(<em><span>1961<meta content="1961" itemprop="datePublished"/></span></em>)Tue Jan 28 08:52:43 CET 2014Commun. ACM7321Algorithm 64: Quicksort.41961quicksort latexkurs dblpAlgorithm 64: Quicksort.https://puma.uni-kassel.de/bibtex/21b58ff39c1c545c2be8114935d3c757d/uk000621uk0006212014-01-28T08:52:24+01:00algorithmen quicksort latexkurs <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="C. A. R. Hoare" itemprop="url" href="/author/C.%20A.%20R.%20Hoare"><span itemprop="name">C. Hoare</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Commun. ACM</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">4 </span></span>(<span itemprop="issueNumber">7</span>):
<span itemprop="pagination">321</span></em> </span>(<em><span>1961<meta content="1961" itemprop="datePublished"/></span></em>)Tue Jan 28 08:52:24 CET 2014Commun. ACM7321Algorithm 64: Quicksort.41961algorithmen quicksort latexkurs dblpAlgorithm 64: Quicksort.https://puma.uni-kassel.de/bibtex/21b58ff39c1c545c2be8114935d3c757d/juergen89juergen892014-01-28T08:52:16+01:00latexkurs <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="C. A. R. Hoare" itemprop="url" href="/author/C.%20A.%20R.%20Hoare"><span itemprop="name">C. Hoare</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Commun. ACM</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">4 </span></span>(<span itemprop="issueNumber">7</span>):
<span itemprop="pagination">321</span></em> </span>(<em><span>1961<meta content="1961" itemprop="datePublished"/></span></em>)Tue Jan 28 08:52:16 CET 2014Commun. ACM7321Algorithm 64: Quicksort.41961latexkurs dblpAlgorithm 64: Quicksort.https://puma.uni-kassel.de/bibtex/21b58ff39c1c545c2be8114935d3c757d/mmemme2013-06-18T18:26:26+02:00algorithmen 2013 kde sorting seminar quicksort <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="C. A. R. Hoare" itemprop="url" href="/author/C.%20A.%20R.%20Hoare"><span itemprop="name">C. Hoare</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Commun. ACM</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">4 </span></span>(<span itemprop="issueNumber">7</span>):
<span itemprop="pagination">321</span></em> </span>(<em><span>1961<meta content="1961" itemprop="datePublished"/></span></em>)Tue Jun 18 18:26:26 CEST 2013Commun. ACM7321Algorithm 64: Quicksort.41961algorithmen 2013 kde sorting seminar quicksort dblpQuicksorthttps://puma.uni-kassel.de/bibtex/2fa584e8539f5c8d6dbf7bd8cab4578d4/mmemme2013-06-18T18:25:43+02:00laufzeit algorithmen komplexität mergesort quicksort <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="C. A. R. Hoare" itemprop="url" href="/author/C.%20A.%20R.%20Hoare"><span itemprop="name">C. Hoare</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>The Computer Journal</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">5 </span></span>(<span itemprop="issueNumber">1</span>):
<span itemprop="pagination">10-16</span></em> </span>(<em><span>1962<meta content="1962" itemprop="datePublished"/></span></em>)Tue Jun 18 18:25:43 CEST 2013The Computer Journal110-16Quicksort51962laufzeit algorithmen komplexität mergesort quicksort 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.Algorithm 64: Quicksort.https://puma.uni-kassel.de/bibtex/21b58ff39c1c545c2be8114935d3c757d/jpbajpba2013-06-17T19:10:38+02:002013 kde sorting seminar quicksort <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="C. A. R. Hoare" itemprop="url" href="/author/C.%20A.%20R.%20Hoare"><span itemprop="name">C. Hoare</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Commun. ACM</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">4 </span></span>(<span itemprop="issueNumber">7</span>):
<span itemprop="pagination">321</span></em> </span>(<em><span>1961<meta content="1961" itemprop="datePublished"/></span></em>)Mon Jun 17 19:10:38 CEST 2013Commun. ACM7321Algorithm 64: Quicksort.419612013 kde sorting seminar quicksort dblpQuicksorthttps://puma.uni-kassel.de/bibtex/2fa584e8539f5c8d6dbf7bd8cab4578d4/sebastianrungesebastianrunge2013-06-17T11:04:01+02:00algorithm kdesems2013 sorting quicksort <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="C. A. R. Hoare" itemprop="url" href="/author/C.%20A.%20R.%20Hoare"><span itemprop="name">C. Hoare</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>The Computer Journal</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">5 </span></span>(<span itemprop="issueNumber">1</span>):
<span itemprop="pagination">10-16</span></em> </span>(<em><span>1962<meta content="1962" itemprop="datePublished"/></span></em>)Mon Jun 17 11:04:01 CEST 2013The Computer Journal110-16Quicksort51962algorithm kdesems2013 sorting quicksort 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. Quicksorthttps://puma.uni-kassel.de/bibtex/2fa584e8539f5c8d6dbf7bd8cab4578d4/wlawla2011-07-08T13:05:01+02:00algorithm kde sorting seminar quicksort <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="C. A. R. Hoare" itemprop="url" href="/author/C.%20A.%20R.%20Hoare"><span itemprop="name">C. Hoare</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>The Computer Journal</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">5 </span></span>(<span itemprop="issueNumber">1</span>):
<span itemprop="pagination">10-16</span></em> </span>(<em><span>1962<meta content="1962" itemprop="datePublished"/></span></em>)Fri Jul 08 13:05:01 CEST 2011The Computer Journal110-16{Quicksort}51962algorithm kde sorting seminar quicksort 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.
Quicksort -- Hoare 5 (1): 10 -- The Computer Journal