LYCOS RETRIEVER 
Shell Sort: Sequences
built 178 days ago
Invented by D. Shell, it was the fastest known sort before quicksort was invented. A generalization of insertion sort. Lots of research has gone in finding the optimum intervals of the sequence of separations, and trying to find upper bounds of its complexity. For shellsort2, complexity is considered to be O(n^(3/2)) in the worst case.
Source:
Shellsort can be implemented as a sorting network if the data-dependent Insertion Sort is replaced with Bubble Sort. With the h-sequence 2p3q the sorting network consists of O(n·log(n)2) comparators. This is the same number of comparators as in Bitonic Sort.
Source:
It was proposed by Shell (1959) and still in many cases holds its own against other competitors due to its simplicity and the ability to use partially ordered sequences. Knuth found that the shall sort efficiency is
Source:
MORE ABOUT
Sequences