On The Average-Case Complexity of Shellsort
Data Structures and Algorithms
2019-08-29 v4 Computational Complexity
Abstract
We prove a lower bound expressed in the increment sequence on the average-case complexity of the number of inversions of Shellsort. This lower bound is sharp in every case where it could be checked. A special case of this lower bound yields the general Jiang-Li-Vit\'anyi lower bound. We obtain new results e.g. determining the average-case complexity precisely in the Yao-Janson-Knuth 3-pass case.
Cite
@article{arxiv.1501.06461,
title = {On The Average-Case Complexity of Shellsort},
author = {Paul M. B. Vitanyi},
journal= {arXiv preprint arXiv:1501.06461},
year = {2019}
}
Comments
13 pages LaTeX