Average-Case Complexity of Shellsort

We demonstrate an ⍀( pn1ϩ1/p) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is the first nontrivial general lower bound for average-case Shellsort. Categories and Subject Descriptors: E.4 [Coding and Information Theory]: data compaction and

• Type: Conference
• Year: 1999
• Where: ICALP
• Authors: Tao Jiang, Ming Li, Paul M. B. Vitányi
• Keywords: Average-case Running Time, General Lower Bound, ICALP 1999, Lower Bound, Programming Languages