A lower bound on the 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.