1、排序原理
1)把要排序的数组的长度除以2用这个值作为间隔把这个数组分成多个部分,然后把每个部分分别进行插入排序;
2)完成一次排序后在把刚才的那个间隔除以2,继续用现在的间隔把数组分成多个部分,然后每个部分分别进行插入排序;
3)一直循环上面两个步骤直到间隔小于1结束,这个时候的结果就是排序完成后的结果。
2、排序代码
package sort;
import java.util.Arrays;
public class ShellSort {
public static void main(String[] args) {
int a[] = {34, 432, 43, 32, 433, 123, 543, 1, 322,
341, 134, 30, 241, 53, 41, 4124, 35};
int d = a.length / 2;
while(d > 0){
for (int i = d; i < a.length; i++) {
int temp = a[i];
int j = i - d;
while( j >= 0 && a[j] > temp){
a[j + d] = a[j];
j = j - d;
}
a[j + d] = temp;
}
System.out.println("d = " + d + " 外部循环结束: " + Arrays.toString(a));
d = d / 2;
}
System.out.println(Arrays.toString(a));
}
}
结果:
d = 8 外部循环结束: [34, 341, 43, 30,241,53,41,1,35,432,134, 32, 433,123,543,4124, 322]
d = 4 外部循环结束: [34,53,41,1, 35,123,43,30, 241, 341,134,32,322, 432, 543,4124,433]
d = 2 外部循环结束: [34, 1, 35, 30,41,32,43, 53, 134,123,241,341, 322, 432,433,4124,543]
d = 1 外部循环结束: [1, 30, 32, 34, 35, 41, 43, 53, 123, 134, 241, 322, 341, 432, 433, 543, 4124]
[1, 30, 32, 34, 35, 41, 43, 53, 123, 134, 241, 322, 341, 432, 433, 543, 4124]