Empirical study of the expected running time for shellsort

Authors:
M. A. Weiss
Affiliations:
Florida International Univ., Miami
Venue:
The Computer Journal - Special issue on term rewriting
Year:
1991

Citing 0
Cited 4

Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms

WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Using finite experiments to study asymptotic performance

Experimental algorithmics
A new approach to bucket sort

SEPADS'08 Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems
Engineering quicksort

Computer Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract