## Analysis of Shellsort and related algorithms (1996)

### Cached

### Download Links

- [thomas.baudel.name]
- [www.cs.princeton.edu]
- [www.cs.princeton.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | ESA ’96: Fourth Annual European Symposium on Algorithms |

Citations: | 26 - 0 self |

### BibTeX

@INPROCEEDINGS{Sedgewick96analysisof,

author = {Robert Sedgewick},

title = {Analysis of Shellsort and related algorithms},

booktitle = {ESA ’96: Fourth Annual European Symposium on Algorithms},

year = {1996},

pages = {25--27},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

This is an abstract of a survey talk on the theoretical and empirical studies that have been done over the past four decades on the Shellsort algorithm and its variants. The discussion includes: upper bounds, including linkages to number-theoretic properties of the algorithm; lower bounds on Shellsort and Shellsort-based networks; average-case results; proposed probabilistic sorting networks based on the algorithm; and a list of open problems. 1 Shellsort The basic Shellsort algorithm is among the earliest sorting methods to be discovered (by D. L. Shell in 1959 [36]) and is among the easiest to implement, as exhibited by the following C code for sorting an array a[l],..., a[r]: shellsort(itemType a[], int l, int r) { int i, j, h; itemType v;