BIT Numerical Mathematics

, Volume 13, Issue 4, pp 394–400 | Cite as

Analysis of a shellsort algorithm

  • Terje O. Espelid
Article

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Boothroyd,ALGORITHM 201, Shellsort, Communications of the ACM 6 (1963), 445.Google Scholar
  2. 2.
    Datamatik III. Bearbeiding av middelstore datamengder, Hefte 8, intern sortering, Regnecentralen København (1969) Studentlitteratur Lund.Google Scholar
  3. 3.
    R. M. Frank and R. B. Lazarus,A High-speed Sorting Procedure, Communications of the ACM 3 (1960), 20.Google Scholar
  4. 4.
    D. L. Shell,A High-speed Sorting Procedure, Communications of the ACM 2 (1959), 30.Google Scholar

Copyright information

© BIT Foundations 1973

Authors and Affiliations

  • Terje O. Espelid
    • 1
  1. 1.Department of Applied MathematicsUniversity of BergenBergenNorway

Personalised recommendations