稳定性:[不稳定](不稳定的算法结构：如果有两个相同的元素5,会导致第一个5和第二个5的位置发生改变)
*/
package seven_happy;
public class Code_Demo {
/**
* author: Ain model: write a code about ShellSort date:2016-3-9
*/
// 定义变量值
private static final int[] a = { 3, 0, 1, 8, 7, 2, 5, 4, 9, 6 };
private static final String SORT_AGO = "希尔排序之前：";
private static final String SORT_AFTER = "希尔排序之后：";
// 主程序入口
public static void main(String[] args) {
ShellSort(a);
System.out.println();
System.out.print(SORT_AFTER);
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + " ");
}
}
public static void ShellSort(int[] a) {
System.out.print(SORT_AGO);
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + " ");
}
// 希尔排序
int d = a.length;
while (true) {
d = d / 2;
for (int x = 0; x < d; x++) {
for (int i = x + d; i < a.length; i = i + d) {
int temp = a[i];
int j;
for (j = i - d; j >= 0 && a[j] > temp; j = j - d) {
a[j + d] = a[j];
}
a[j + d] = temp;
}
}
if (d == 1) {
break;
}
}
}
}
