论文信息 - An Improvement on Tree Selection Sort

An Improvement on Tree Selection Sort

The standard Tree Selection Sort is an efficient sorting algorithm but requires extra storage for n-1 pointers and n items. The goal of this paper is to not only reduce the extra storage of Tree Selection Sort to n bits, but also keep the number of comparisons at nlogn+O(n). The improved algorithm makes at most 3n data movements. The empirical results show that the improved algorithm is efficient. In some cases, say moving one item requires at least 3 assignment operations, the algorithm is the fastest on average among known fast algorithms.

Jingchao Chen

[1] Donald E. Knuth,et al. Sorting and Searching , 1973 .

[2] Donald E. Knuth,et al. The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

[3] Svante Carlsson. A Variant of Heapsort with Almost Optimal Number of Comparisons , 1987, Inf. Process. Lett..

[4] Jing Chao Chen. Proportion Extend Sort , 2001, SIAM J. Comput..

[5] Edward H. Friend,et al. Sorting on Electronic Computer Systems , 1956, JACM.

[6] J.-C. Chen,et al. Proportion Split Sort , 1996, Nord. J. Comput..

[7] Richard E. Ladner,et al. The influence of caches on the performance of sorting , 1997, SODA '97.

[8] Gaston H. Gonnet,et al. Heaps on Heaps , 1982, ICALP.

[9] C. A. R. Hoare. Algorithm 63: partition , 1961, CACM.

[10] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[11] Bruce A. Reed,et al. Building Heaps Fast , 1989, J. Algorithms.

[12] Ingo Wegener. The Worst Case Complexity of McDiarmid and Reed's Variant of BOTTOM-UP HEAPSORT is less than nlog n + 1.1n , 1992, Inf. Comput..

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

[14] Ronald D. Dutton,et al. Weak-heap sort , 1993, BIT.

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