Abstract
A boundO(N 1+1/k) for the running time of Shellsort, withO(logN) passes, is proved very simply by application of a Frobenius basis withk elements.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Brauer,On a problem of partitions, Amer. J. Math. 64 (1942), 299–312.
A. Brauer and B. M. Seelbinder,On a problem of partitions, II, amer. J. Math. 76 (1954), 343–346.
G. Hofmeister,Zu einem Problem von Frobenius, Kgl. Norske Vid. Selsk. Skrifter, 1966, Nr. 5, 1–37.
J. Incerpi and R. Sedgewick,Improved upper bounds on Shellsort, J. Comput. System Sci. 31 (1985), 210–224.
Ö. J. Rödseth,Two remarks on linear forms in non-negative integers, Math. Scand. 51 (1982), 193–198.
R. Sedgewick,A new upper bound for Shellsort, J. of Algorithms 7 (1986), 159–173.
E. S. Selmer,On the linear diophantine problem of Frobenius, J. reine angew. Math. 293/294 (1977), 1–17.