More on shellsort increment sequences
- 7 May 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 34 (5) , 267-270
- https://doi.org/10.1016/0020-0190(90)90134-j
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On Shellsort and the frobenius problemBIT Numerical Mathematics, 1989
- Tight lower bounds for ShellsortPublished by Springer Nature ,1988
- A new upper bound for ShellsortJournal of Algorithms, 1986
- Improved upper bounds on shellsortJournal of Computer and System Sciences, 1985
- A Linear Diophantine ProblemCanadian Journal of Mathematics, 1960
- A high-speed sorting procedureCommunications of the ACM, 1959
- On a Problem of PartitionsAmerican Journal of Mathematics, 1942