Difference between revisions 29549116 and 29587185 on enwiki

'''Shell sort''' (or '''Shellsort''') is one of the oldest [[sorting algorithm|sorting algorithms]]. It was invented in 1959 by [[D. L. Shell|Donald L. Shell]] <nowiki>[</nowiki>[[#References|Sh]]<nowiki>]</nowiki>. It is fast, easy to understand and easy to implement. 
(contracted; show full)

== Analysis ==

The correctness of the algorithm follows from the fact that in the last step (with ''h'' = 1) an ordinary insertion sort is performed on the whole array. 
But since data are presorted by the preceding steps (''h'' =
 1, 3, 7, 15, 31, ...), only a few insertion sort steps are sufficient. 
The exact number depends on the sequence of ''h'' values (denoted as ''h''-sequence). The ''h''-sequence above is just one of several possible.

(contracted; show full)[[es:Ordenación Shell Sort]]
[[it:Shell sort]]
[[lt:Šelo rūšiavimo algoritmas]]
[[nl:Shellsort]]
[[ja:シェルソート]]
[[pl:Sortowanie Shella]]
[[pt:Shell sort]]
[[zh:希尔排序]]