Difference between revisions 15969320 and 18634961 on enwiki

< previous diff
next diff >
Shell sort
'''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.  
(contracted; show full)        hh = hh - h; // hh = 13 - 5 = 8
    }
}</pre>

The squares of Fibonacci numbers (1, 4, 9, 25, ...) make an even better sequence.

==References==
[Kn] 
 D.Donald E. Knuth: ''Sorting and Searching'', vol. 3 of ''[[The Art of Computer Programming. Addison-Wesley (1973)]]'', second edition. Addison-Wesley (1998). ISBN 0-201-89685-0<br>
[Se]   R.obert Sedgewick: ''Algorithms''. Addison-Wesley (1988)<br>
[Sh]  D.Donald L. Shell: ''A high-speed sorting procedure. ''. [[Communications of the ACM]] 2 (7), 30-32 (1959)

== External links ==
*[http://www.iti.fh-flensburg.de/lang/algorithmen/sortieren/shell/shellen.htm Detailed analysis of Shell sort]
* [http://www.nist.gov/dads/HTML/shellsort.html Dictionary of Algorithms and Data Structures: Shellsort]

[[Category:Sort algorithms]]

[[de:Shellsort]]
[[es:Ordenación Shell Sort]]
[[it:Shell sort]]
[[lt:Kevalo r&#363;&#353;iavimo algoritmas]]
[[nl:Shellsort]]
[[ja:&#12471;&#12455;&#12523;&#12477;&#12540;&#12488;]]
[[zh:&#24076;&#23572;&#25490;&#24207;]]