Average-Case Complexity of Shellsort

Details Average-Case Complexity of Shellsort Average-Case Complexity of Shellsort

1999-01-20

arxiv.org/abs/cs/9901010v1

Computer Science

Data Structures and Algorithms

11 pages. Submitted to ICALP'99

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 all $p
\leq \log n$. Using similar arguments, we analyze the average-case complexity
of several other sorting algorithms.

Affiliated with

Also associated with

No associations

Rating

Average-Case Complexity of Shellsort 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, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Average-Case Complexity of Shellsort will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-5966