希尔排序

package com.paixu;


public class SheelSrot {

public int[] sheelSort(int[] src){
int l ;
for(int dk = src.length/2;dk>0;dk/=2){
for(int i=dk;i<src.length;i++){
int j=i-dk;
l = src[i];
while((j>=0)&&(l<src[j])){
src[j+dk] = src[j];
j -= dk;
}
src[j+dk] = l;
}
}
return src;
}
public static void main(String[] args) {
int[] src1 = {49,38,65,97,76,13,27,49};
int[] src = new SheelSrot().sheelSort(src1);
for(int i=0;i<src.length;i++){
System.out.print(src[i]+" ");
}
}


}