Average-Case Complexity of Shellsort (Preliminary version)

Details Average-Case Complexity of Shellsort (Preliminary version) Average-Case Complexity of Shellsort (Preliminary version)

1999-06-04

arxiv.org/abs/cs/9906008v1

Computer Science

Computational Complexity

10 pages, 2 figures, Proc ICALP 99, Springer LNCS

Scientific paper

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 $\Omega (pn^{1 + 1/p})$ for every $p$. The proof method is an incompressibility argument based on Kolmogorov complexity. Using similar techniques, the average-case complexity of several other sorting algorithms is analyzed.

Affiliated with

Also associated with

No associations

Rating

Average-Case Complexity of Shellsort (Preliminary version) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Average-Case Complexity of Shellsort (Preliminary version), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Average-Case Complexity of Shellsort (Preliminary version) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-126855