Average-Case Complexity of Shellsort

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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 $Ω(pn^{1 + 1/p)$ for all $p \leq \log n$. Using similar arguments, we analyze the average-case complexity of several other sorting algorithms.
11 pages. Submitted to ICALP'99

Keywords

Data Structures and Algorithms, Computational Complexity, F.2.2; F.1.3

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/33128

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/9901010
 http://arxiv.org/abs/cs/9901010

Collections

arXiv