package lwm.algorithm.sort;
public class ShellSort {
public void ShellInsert(int[] arr,int dk){
int i,j;
for(i=dk+1;i<=arr.length-1;i++){
if(arr[i]>arr[i-dk]){
arr[0]=arr[i];
for(j=i-dk;j>0&&arr[0]>arr[j];j-=dk){
arr[j+dk]=arr[j];
arr[j+dk]=arr[0];
}
}
}
}
public void ShellSort(int[] arr,int[] dlta,int t){
for(int k=0;k<t;k++)
ShellInsert(arr,dlta[k]);
}
}