Difference between revisions 13061454 and 13141262 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. (contracted; show full) [Se] R. Sedgewick: Algorithms. Addison-Wesley (1988)<br> [Sh] D.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ūšiavimo algoritmas]] [[nl:Shellsort]] [[ja:シェルソート]] [[zh:希尔排序]]⏎ [[Category:Sort algorithms]] All content in the above text box is licensed under the Creative Commons Attribution-ShareAlike license Version 4 and was originally sourced from https://en.wikipedia.org/w/index.php?diff=prev&oldid=13141262.
![]() ![]() This site is not affiliated with or endorsed in any way by the Wikimedia Foundation or any of its affiliates. In fact, we fucking despise them.
|