ShellSort : Java Glossary

go to home page S words local find full screen, hide local find menu Google search web for more information on this topic jump to foot of page translate this page with Babelfish punctuation 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z (all) ©1996-2009 Roedy Green, Canadian Mind Products
ShellSort
Basically, you have a list of numbers to sort, and a set of separation distances: a1, a2,… an, where ai > a(i+1). First you compare pairs of numbers ai apart and swap as necessary. Then, you compare pairs a2 apart, swapping as necessary, etc. until you compare and swap immediately adjacent values. The efficiency of the sort will of course depend on a good choice for the values a1 through an. ShellSort source code download.
HeapSort
O(n²)
QuickSort
RadixSort
Sort
CMP homejump to top You can get the freshest copy of this page from: or possibly from your local J: drive (Java virtual drive/mindprod.com website mirror)
http://mindprod.com/jgloss/shellsort.html J:\mindprod\jgloss\shellsort.html
CMP logofeedback Please email your feedback for publication, errors, omissions, typos, formatting errors, ambiguities, unclear wording, broken/redirected link reports, suggestions to improve this page or comments to Roedy Green : feedback email
mindprod.com IP:[65.110.21.43]
view BlogYour face IP:[38.107.191.108]
You are visitor number 12,090.