ShellSort : Java Glossary

ShellSort
Basically, you have a list of numbers to sort, and a set of separation distances: a1, a₂,… an, where ai > a(i+1). First you compare pairs of numbers ai apart and swap as necessary. Then, you compare pairs a₂ 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.

available on the web at:

http://mindprod.com/jgloss/shellsort.html
ClustrMaps is down

optional Replicator mirror
of mindprod.com
on local hard disk J:

J:\mindprod\jgloss\shellsort.html
logo
Please the feedback from other visitors, or your own feedback about the site.
Contact Roedy.
Blog
IP:[65.110.21.43]
Your face IP:[107.22.45.61]
You are visitor number 16,649.