Difference between revisions 28403596 and 29549116 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. 
However, its complexity analysis is a little more sophisticated.  ⏎
 ⏎
It is easy to develop an intuitive sense of how this algorithm works, but often difficult to analyze its execution time. Like the [[insertion sort]] it is based on, it is a [[comparison sort]].

Shell sort is sometimes called "Shell-Metzner sort" after [[Marlene Metzner]] who wrote a very early implementation of Shell sort in [[FORTRAN]].  It was first called Shell-Metzner in an article in ''Creative Computing'' in [[1976]], but Marlene Metzner has said that her name should never have been attached to it.

== Basic concept ==

Shell sort is an extension of [[insertion sort]], with two observations in mind: 
(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:希尔排序]]