2 search results - page 1 / 1 » Best Increments for the Average Case of Shellsort |
FCT
2001
Springer
13 years 9 months ago
2001
Springer
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
JOIN
2007
13 years 5 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...