希尔排序（复杂度最好为n3/2）

package sort;
public class ShellSort {


public static void main(String[] args) {
int[]a={1,600,3,2,45,2,8,0};
display(a);
         sortMethod(a);
         display(a);
}

public static void display(int[] s){
for(int k=0;k<s.length;k++){
System.out.print(s[k]+" ");
}
System.out.println();
}

public static void sortMethod(int[]s){
int stringlength=s.length;
int temp,j;
for(int increment=(int)(stringlength/2);increment>=1;increment=increment/2){
for(int i=increment;i<s.length;i++)
{
if(s[i]<s[i-increment]){
temp=s[i];
for(j=i-increment;j>=0&&s[j]>temp;j=j-increment){
s[j+increment]=s[j];
}
s[j+increment]=temp;
}
}
}
}
}