Abstract
D. L. Shell published in 1959, [4], a fast algorithm for internal sorting. R. M. Frank and R. B. Lazarus pointed out in 1960, [3], a disadvantage in the original design of the algorithm and changes were proposed based on heuristic arguments. J. Boothroyd took care of Frank and Lazarus objections in an elegant algorithm published 1963, [1]. If we change Boothroyds algorithm slightly we get an algorithm which, in the general case with the arguments of Frank and Lazarus, is even worse than the original one. On the other hand this algorithm has the advantage that it is easy to analyse theoretically. To the author's knowledge such an analysis has not yet been given for any of the other Shellsort algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Boothroyd,ALGORITHM 201, Shellsort, Communications of the ACM 6 (1963), 445.
Datamatik III. Bearbeiding av middelstore datamengder, Hefte 8, intern sortering, Regnecentralen København (1969) Studentlitteratur Lund.
R. M. Frank and R. B. Lazarus,A High-speed Sorting Procedure, Communications of the ACM 3 (1960), 20.
D. L. Shell,A High-speed Sorting Procedure, Communications of the ACM 2 (1959), 30.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Espelid, T.O. Analysis of a shellsort algorithm. BIT 13, 394–400 (1973). https://doi.org/10.1007/BF01933401
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01933401