Analysis of Shellsort and related algorithms

Analysis of Shellsort and related algorithms (1996)

by Robert Sedgewick

Venue:	ESA ’96: Fourth Annual European Symposium on Algorithms
Citations:	23 - 0 self

Datum	Value	Source
TITLE	Analysis of Shellsort and related algorithms	INFERENCE
AUTHOR NAME	Robert Sedgewick	SVM HeaderParse 0.2
AUTHOR AFFIL	; Princeton University	SVM HeaderParse 0.2
AUTHOR ADDR	; int incs[16] = { 1391376, 463792, 198768, 86961, 33936,; 13776, 4592, 1968, 861, 336,; 112, 48, 21, 7, 3, 1};	SVM HeaderParse 0.2
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;	SVM HeaderParse 0.2
YEAR	1996	INFERENCE
VENUE	ESA ’96: Fourth Annual European Symposium on Algorithms	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	25--27	INFERENCE
VOLUME	1136	INFERENCE
CITATIONS	44 found	ParsCit 1.0