Shellsort with three increments

Details Shellsort with three increments Shellsort with three increments

1996-08-22

arxiv.org/abs/cs/9608105v1

Random Structures Algorithms 10 (1997), no. 1-2, 125--142

Computer Science

Data Structures and Algorithms

Scientific paper

A perturbation technique can be used to simplify and sharpen A. C. Yao's
theorems about the behavior of shellsort with increments $(h,g,1)$. In
particular, when $h=\Theta(n^{7/15})$ and $g=\Theta(h^{1/5})$, the average
running time is $O(n^{23/15})$. The proof involves interesting properties of
the inversions in random permutations that have been $h$-sorted and $g$-sorted.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-162066