Average-Case Complexity of Shellsort
Data Structures and Algorithms
2007-05-23 v1 Computational Complexity
Abstract
We prove a general lower bound on the average-case complexity of Shellsort: the average number of data-movements (and comparisons) made by a -pass Shellsort for any incremental sequence is \Omega (pn^{1 + 1/p) for all . Using similar arguments, we analyze the average-case complexity of several other sorting algorithms.
Cite
@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}
}
Comments
11 pages. Submitted to ICALP'99