DMCA
A Lower Bound on the Average-Case Complexity of Shellsort
Cached
Download Links
- [www.cwi.nl]
- [www.cwi.nl]
- [homepages.cwi.nl]
- [homepages.cwi.nl]
- DBLP
Other Repositories/Bibliography
by
Tao Jiang
,
Ming Li
,
Paul Vitányi
| Citations: | 11 - 5 self |
BibTeX
@MISC{Jiang_alower,
author = {Tao Jiang and Ming Li and Paul Vitányi},
title = {A Lower Bound on the Average-Case Complexity of Shellsort},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We demonstrate an #( pn 1#1/p) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is the first nontrivial general lower bound for average-case Shellsort.
