Lower Bounds for Shellsort

C. Greg Plaxton, Torsten Suel

    Research output: Contribution to journalArticle

    Abstract

    We show lower bounds on the worst-case complexity of Shellsort. In particular, we give a fairly simple proof of an Ω(n (lg2 n)/(lg lg n)2) lower bound for the size of Shellsort sorting networks for arbitrary increment sequences. We also show an identical lower bound for the running time of Shellsort algorithms, again for arbitrary increment sequences. Our lower bounds establish an almost tight trade-off between the running time of a Shellsort algorithm and the length of the underlying increment sequence.

    Original languageEnglish (US)
    Pages (from-to)221-240
    Number of pages20
    JournalJournal of Algorithms
    Volume23
    Issue number2
    StatePublished - May 1997

    Fingerprint

    Lower bound
    Increment
    Sorting
    Sorting Networks
    Arbitrary
    Trade-offs

    ASJC Scopus subject areas

    • Computational Theory and Mathematics
    • Computational Mathematics

    Cite this

    Plaxton, C. G., & Suel, T. (1997). Lower Bounds for Shellsort. Journal of Algorithms, 23(2), 221-240.

    Lower Bounds for Shellsort. / Plaxton, C. Greg; Suel, Torsten.

    In: Journal of Algorithms, Vol. 23, No. 2, 05.1997, p. 221-240.

    Research output: Contribution to journalArticle

    Plaxton, CG & Suel, T 1997, 'Lower Bounds for Shellsort', Journal of Algorithms, vol. 23, no. 2, pp. 221-240.
    Plaxton CG, Suel T. Lower Bounds for Shellsort. Journal of Algorithms. 1997 May;23(2):221-240.
    Plaxton, C. Greg ; Suel, Torsten. / Lower Bounds for Shellsort. In: Journal of Algorithms. 1997 ; Vol. 23, No. 2. pp. 221-240.
    @article{ba7a0da206fe487b8191b2204efded85,
    title = "Lower Bounds for Shellsort",
    abstract = "We show lower bounds on the worst-case complexity of Shellsort. In particular, we give a fairly simple proof of an Ω(n (lg2 n)/(lg lg n)2) lower bound for the size of Shellsort sorting networks for arbitrary increment sequences. We also show an identical lower bound for the running time of Shellsort algorithms, again for arbitrary increment sequences. Our lower bounds establish an almost tight trade-off between the running time of a Shellsort algorithm and the length of the underlying increment sequence.",
    author = "Plaxton, {C. Greg} and Torsten Suel",
    year = "1997",
    month = "5",
    language = "English (US)",
    volume = "23",
    pages = "221--240",
    journal = "Journal of Algorithms",
    issn = "0196-6774",
    publisher = "Academic Press Inc.",
    number = "2",

    }

    TY - JOUR

    T1 - Lower Bounds for Shellsort

    AU - Plaxton, C. Greg

    AU - Suel, Torsten

    PY - 1997/5

    Y1 - 1997/5

    N2 - We show lower bounds on the worst-case complexity of Shellsort. In particular, we give a fairly simple proof of an Ω(n (lg2 n)/(lg lg n)2) lower bound for the size of Shellsort sorting networks for arbitrary increment sequences. We also show an identical lower bound for the running time of Shellsort algorithms, again for arbitrary increment sequences. Our lower bounds establish an almost tight trade-off between the running time of a Shellsort algorithm and the length of the underlying increment sequence.

    AB - We show lower bounds on the worst-case complexity of Shellsort. In particular, we give a fairly simple proof of an Ω(n (lg2 n)/(lg lg n)2) lower bound for the size of Shellsort sorting networks for arbitrary increment sequences. We also show an identical lower bound for the running time of Shellsort algorithms, again for arbitrary increment sequences. Our lower bounds establish an almost tight trade-off between the running time of a Shellsort algorithm and the length of the underlying increment sequence.

    UR - http://www.scopus.com/inward/record.url?scp=0040941724&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0040941724&partnerID=8YFLogxK

    M3 - Article

    VL - 23

    SP - 221

    EP - 240

    JO - Journal of Algorithms

    JF - Journal of Algorithms

    SN - 0196-6774

    IS - 2

    ER -