Lower Bounds for Shellsort |
| |
Authors: | CGreg Plaxton Torsten Suel |
| |
Institution: | Department of Computer Science, University of Texas at Austin, Austin, Texas, 78712 |
| |
Abstract: | We show lower bounds on the worst-case complexity of Shellsort. In particular, we give a fairly simple proof of an Ω(n (lg2 n)/(lg lg n)2) lower bound for the size of Shellsort sorting networks for arbitrary increment sequences. We also show an identical lower bound for the running time of Shellsort algorithms, again for arbitrary increment sequences. Our lower bounds establish an almost tight trade-off between the running time of a Shellsort algorithm and the length of the underlying increment sequence. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|