Asymptotic analysis of (3, 2, 1)-shell sort

Authors:
R. T. Smythe;J. A. Wellner
Affiliations:
Department of Statistics, Oregon State University, Corvallis, OR;Statistics, University of Washington, Box 354322, Seattle, WA
Venue:
Random Structures & Algorithms
Year:
2002

Brownian motion and algorithm complexity

BIT
An introduction to the analysis of algorithms

An introduction to the analysis of algorithms
Shellsort with three increments

Random Structures & Algorithms - Special issue: average-case analysis of algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
A high-speed sorting procedure

Communications of the ACM
Analysis of Shellsort and Related Algorithms

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms

Hi-index	0.00

We analyze the (3, 2, 1)-Shell Sort algorithm under the usual random permutation model.