Average-Case Complexity of Shellsort
<|reference_start|>Average-Case Complexity of Shellsort: We prove a general lower bound on the average-case complexity of Shellsort: the average number of data-movements (and comparisons) made by a $p$-pass Shellsort for any incremental sequence is $\Omega (pn^{1 + 1/p)$ for all $p \leq \log n$. Using similar arguments, we analyze the average-case complexity of several other sorting algorithms.<|reference_end|>
@article{jiang1999average-case,
    title={Average-Case Complexity of Shellsort},
    author={Tao Jiang (McMaster U.), Ming Li (U of Waterloo), Paul Vitanyi (CWI
  and U of Amsterdam)},
    journal={arXiv preprint arXiv:cs/9901010},
    year={1999},
    archivePrefix={arXiv},
    eprint={cs/9901010},
    primaryClass={cs.DS cs.CC}
}