ShellSort : Java Glossary

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.

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
logo
Please email your , letters to the editor, errors, omissions, typos, formatting errors, ambiguities, unclear wording, broken/redirected link reports, suggestions to improve this page or comments to Roedy Green : feedback email. If you want your message, your name or email kept confidential, not considered for public posting, please explicitly specify that. Unless you state otherwise, I will treat your message as a letter to the editor that I may or may not publish in the feedback section. After that, it will be too late to retract it. If you disagree with something I said, please quote it and cite the web page where you found it, tell me why you think it is wrong, and, if possible, provide some supporting evidence. Threatening to kill me or spouting obscenities has yet to persuade me to change my mind.
mindprod.com IP:[65.110.21.43]
view BlogYour face IP:[38.107.179.214]
You are visitor number 15,354.