论文信息 - Sorting in linear expected time

Sorting in linear expected time

A new sorting algorithm, Double Distributive Partitioning, is introduced and compared against Sedgewick's quicksort. It is shown that the Double Distributive Partitioning algorithm runs, for all practical purposes, inO(n) time for many distributions of keys. Furthermore, the combined number of comparisons, additions, and assignments required to sort by the new method on these distributions is always less than quicksort.

Donald C. S. Allison | M. T. Noga

[1] Robert Sedgewick,et al. Implementing Quicksort programs , 1978, CACM.

[2] Wlodzimierz Dobosiewicz,et al. Sorting by Distributive Partitioning , 1978, Inf. Process. Lett..

[3] Selim G. Akl,et al. The Design and Analysis of a New Hybrid Sorting Algorithm , 1980, Inf. Process. Lett..

[4] Rudolf Loeser. Some performance tests of “quicksort” and descendants , 1974, CACM.

[5] M. van der Nat. A Fast Sorting Algorithm, a Hybrid of Distributive and Merge Sorting , 1980, Inf. Process. Lett..

[6] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[7] Allen Van Gelder,et al. Computer Algorithms: Introduction to Design and Analysis , 1978 .

[8] M. Noga. Fast geometric algorithms , 1984 .

[9] Richard C. Singleton. Algorithm 347: an efficient algorithm for sorting with minimal storage [M1] , 1969, CACM.

[10] Donald C. S. Allison,et al. Usort: An efficient hybrid of Distributive Partitioning Sorting , 1982, BIT Comput. Sci. Sect..

[11] C. A. R. Hoare,et al. Algorithm 65: find , 1961, Commun. ACM.

[12] C. A. R. Hoare,et al. Algorithm 64: Quicksort , 1961, Commun. ACM.