Improved lower bounds for Shellsort

Authors:
C. G. Plaxton;B. Poonen;T. Suel
Affiliations:
Dept. of Comput. Sci., Texas Univ., Austin, TX, USA;-;-
Venue:
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Year:
1992

Citing 0
Cited 2

Average-Case Complexity of Shellsort

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Incompressibility Method

SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The authors give improved lower bounds for Shellsort based on a new and relatively simple proof idea. The lower bounds obtained are both stronger and more general than the previously known bounds. In particular, they hold for nonmonotone increment sequences and adaptive Shellsort algorithms, as well as for some recently proposed variations of Shellsort.