ShellSort : Java Glossary

by Roedy Green ©1996-2008 Canadian Mind Products
Go to : 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)

ShellSort: Basically, you have a list of numbers to sort, and a set of separation distances: a₁, a₂,… a_n, where a_i > a_(i+1). First you compare pairs of numbers a_i 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 a₁ through a_n. ShellSort source code download.
HeapSort
O(n²)
QuickSort
RadixSort
Sort

	Please email your feedback for publication, errors, omissions, broken/redirected link reports and suggestions to improve this page to Roedy Green :
	Canadian Mind Products
	mindprod.com IP:[65.110.21.43]
	Your face IP:[38.103.63.16]	The information on this page is for non-military use only.
	You are visitor number 9,665.	Military use includes use by defence contractors.
	You can get a fresh copy of this page from:	or possibly from your local J: drive (Java virtual drive/Mindprod website mirror)
	http://mindprod.com/jgloss/shellsort.html	J:\mindprod\jgloss\shellsort.html