analysis of shellsort and related algorithms（分析shellsort和相关算法）.pdf

Analysis of Shellsort and Related Algorithms Robert Sedgewick* Princeton University 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 dis- covered (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; int incs[16] = { 1391376, 463792, 198768, 86961, 33936, 13776, 4592, 1968, 861, 336, 112, 48, 21, 7, 3, 1 }; for ( k = 0; k 16; k++) for (h = incs[k], i = l+h; i = r; i++) { v = a[i]; j = i; while (j h a[j-h] v) { a[j] = a[j-h]; j -= h; } a[j] = v; } } The algorithm is based on insertion sort: proceed left to right through a file, inserting each element into position among the elements to its left (which are in sorted order) by moving the larger ones one position to the right. Shellsort is a sequence of interleaved insertion sorts based on an increment sequence: for each increment h, insertion-s