ShellSort
//cangshu
public class ShellSort {
public static void shellSort(int[] arr){
for(int gap= arr.length/2;gap>0;gap/=2){
for(int i=0;i< arr.length;i++){
for(int j=1;i+gap*j<arr.length;j++){
if(arr[i]>arr[i+gap*j]) {
int k = arr[i];
arr[i] = arr[i + gap*j];
arr[i + gap*j] = k;
}
}
}
}
}
public static void main(String[] args) {
int[] arr={13,12,5,4,6,8,7,9,10,11,2,1,3};
shellSort(arr);
System.out.println("希尔排序后的arr数组");
System.out.print("[");
for (int i = 0; i < arr.length; i++) {
if(i<arr.length-1)
System.out.print(arr[i]+",");
else
System.out.print(arr[i]);
}
System.out.print("]");
}
}