M. H. van Emden
- 1 BECKENBACH, E. F., AND BELLMAN, R. Inequalities. Springer, New York, 1961.Google Scholar
- 2 VAN EMDEN, M. H. Iets quicker dan quicker. Informatic 11 (1969), 30-32.Google Scholar
- 3 FRAZER, W. D., AND MCKELLAR, A. C. Samplesort: a sampling approach to minimal storage time sorting. In proc. of the Third Annual Princeton Conf. on Information Sciences and Systems, 1969, 276280.Google Scholar
- 4 HCARE, C. A. R. Algorithm 64, Quicksort. Comm. ACM 4, 7 (July 1961), 321. Google ScholarDigital Library
- 5 HOARE, C. A. R. Quicksort. Comput. J. 5 (1962), 10-15.Google ScholarCross Ref
- 6 KRUSEMAN ARETZ, F. E. J. Private communication.Google Scholar
- 7 SHANNON, C. The Mathematical Theory of Communication. U. of Illinois Press, Urbana, Ill., 1963. Google ScholarDigital Library
- 8 VAN WIJNGARE, A. Private communication.Google Scholar
- 9 VAN EMDEN, M. H. Algorithm 402: Increasing the efficiency of quicksort. To appear in Comm. ACM 11 (Nov. 1970). Google ScholarDigital Library
Index Terms
- Increasing the efficiency of quicksort
Recommendations
Optimal Partitioning for Dual-Pivot Quicksort
Dual-pivot quicksort refers to variants of classical quicksort where in the partitioning step two pivots are used to split the input into three segments. This can be done in different ways, giving rise to different algorithms. Recently, a dual-pivot ...
GPU-Quicksort: A practical Quicksort algorithm for graphics processors
In this article, we describe GPU-Quicksort, an efficient Quicksort algorithm suitable for highly parallel multicore graphics processors. Quicksort has previously been considered an inefficient sorting solution for graphics processors, but we show that ...
Some performance tests of “quicksort” and descendants
Detailed performance evaluations are presented for six ACM algorithms: quicksort (No. 64), Shellsort (No. 201), stringsort (No. 207), “TREESORT3” (No. 245), quickersort (No. 271), and qsort (No. 402). Algorithms 271 and 402 are refinements of algorithm ...
Comments