Average-Case Complexity of Shellsort

Tao Jiang; Ming Li; Paul Vitanyi

Average-Case Complexity of Shellsort

数据结构与算法 2007-05-23 v1 计算复杂性

作者: Tao Jiang , Ming Li , Paul Vitanyi

摘要

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.

引用

@article{arxiv.cs/9901010,
  title  = {Average-Case Complexity of Shellsort},
  author = {Tao Jiang and Ming Li and Paul Vitanyi},
  journal= {arXiv preprint arXiv:cs/9901010},
  year   = {2007}
}

备注

11 pages. Submitted to ICALP'99

相关论文

查看更多相关论文 →