Improved Upper Bounds on Shellsort

The running time of Shellsort, with the number of passes restricted to O(log N), was thought for some time to be Θ(N3/2), due to general results of Pratt. Sedgewick recently gave an O(N4/3) bound, but extensions of his method to provide better bounds seem to require new results on a classical problem in number theory. In this paper, we use a different approach to achieve O(N1+4/√2lgN).

[1]  Donald L. Shell,et al.  A high-speed sorting procedure , 1959, CACM.

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

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

[4]  Wlodzimierz Dobosiewicz.  An Efficient Variation of Bubble Sort , 1980, Inf. Process. Lett..

[5]  E. Selmer,et al.  On the linear diophantine problem of Frobenius. , 1977 .

[6]  János Komlós,et al.  An 0(n log n) sorting network , 1983, STOC.

[7]  Vaughan R. Pratt.  Shellsort and Sorting Networks , 1972, Outstanding Dissertations in the Computer Sciences.

[8]  Frank Thomson Leighton,et al.  Tight Bounds on the Complexity of Parallel Sorting , 1984, IEEE Transactions on Computers.

[9]  S. Johnson,et al.  A Linear Diophantine Problem , 1960, Canadian Journal of Mathematics.