PUMA publications for /user/mme/algorithmenhttps://puma.uni-kassel.de/user/mme/algorithmenPUMA RSS feed for /user/mme/algorithmen2024-03-29T06:56:14+01:00- Quicksorthttps://puma.uni-kassel.de/bibtex/2fa584e8539f5c8d6dbf7bd8cab4578d4/mmemme2013-06-18T18:25:43+02:00algorithmen komplexität laufzeit 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-16Quicksort51962algorithmen komplexität laufzeit 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.
- Merge Sort Algorithm M1 (Algorithm 426).https://puma.uni-kassel.de/bibtex/2b68c8da501db7bd83e97dc72ba5fe1fd/mmemme2013-06-18T18:28:28+02:00algorithm algorithmen m1 merge sort <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Coenraad Bron" itemprop="url" href="/author/Coenraad%20Bron"><span itemprop="name">C. Bron</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">15 </span></span>(<span itemprop="issueNumber">5</span>):
<span itemprop="pagination">357-358</span></em> </span>(<em><span>1972<meta content="1972" itemprop="datePublished"/></span></em>)Tue Jun 18 18:28:28 CEST 2013Commun. ACM5357-358Merge Sort Algorithm [M1] (Algorithm 426).151972algorithm algorithmen m1 merge sort
- Merge Sort Algorithm (Remark on Algorithm 426).https://puma.uni-kassel.de/bibtex/225501f34498a5562c8c50ed70bea2199/mmemme2013-06-18T18:28:45+02:00algorithmen computer mergesort quicksort sorting <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Coenraad Bron" itemprop="url" href="/author/Coenraad%20Bron"><span itemprop="name">C. Bron</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">17 </span></span>(<span itemprop="issueNumber">12</span>):
<span itemprop="pagination">706</span></em> </span>(<em><span>1974<meta content="1974" itemprop="datePublished"/></span></em>)Tue Jun 18 18:28:45 CEST 2013Commun. ACM12706Merge Sort Algorithm (Remark on Algorithm 426).171974algorithmen computer mergesort quicksort sorting
- Introduction to algorithmshttps://puma.uni-kassel.de/bibtex/2b3558d43184a025c68dd67e7594c8fe5/mmemme2013-06-18T18:27:59+02:002013 algorithmen algorithms kde quicksort seminar sorting <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Thomas H. Cormen" itemprop="url" href="/author/Thomas%20H.%20Cormen"><span itemprop="name">T. Cormen</span></a></span>. </span><em><span itemprop="publisher">The MIT Press</span>, </em><em>Cambridge, Masachusetts; London, </em>(<em><span>2009<meta content="2009" itemprop="datePublished"/></span></em>)Tue Jun 18 18:27:59 CEST 2013Cambridge, Masachusetts; LondonIntroduction to algorithms20092013 algorithmen algorithms kde quicksort seminar sorting Introduction to Algorithms: Amazon.de: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein: Englische Bücher
- Analysis of Internal Computer Sorting.https://puma.uni-kassel.de/bibtex/29b13510df8e5f3d28dcd8a277a8f29ed/mmemme2013-06-18T18:28:14+02:00algorithmen analysis computer internal sorting <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Ivan Flores" itemprop="url" href="/author/Ivan%20Flores"><span itemprop="name">I. Flores</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>J. ACM</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">8 </span></span>(<span itemprop="issueNumber">1</span>):
<span itemprop="pagination">41-80</span></em> </span>(<em><span>1961<meta content="1961" itemprop="datePublished"/></span></em>)Tue Jun 18 18:28:14 CEST 2013J. ACM141-80Analysis of Internal Computer Sorting.81961algorithmen analysis computer internal sorting dblp
- Algorithm 64: Quicksort.https://puma.uni-kassel.de/bibtex/21b58ff39c1c545c2be8114935d3c757d/mmemme2013-06-18T18:26:26+02:002013 algorithmen kde quicksort seminar sorting <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.419612013 algorithmen kde quicksort seminar sorting dblp