java 数据结构基本算法希尔排序

public class ShellSort {    public static void main(String[] args) {    int a[] = { 49, 38, 65, 97, 76, 13, 27, 49, 78, 34, 12, 64, 5, 4, 62, 99, 98, 54,         56, 17, 18, 23, 34, 15, 35, 25, 53, 51 };    int d = a.length;    int temp = 0;    while (true) {      d = d / 2;      for (int x = 0; x < d; x++) {        //对每一个组进行直接插入排序        for (int i = x + d; i < a.length; i += d) {          int j = i - d;          temp = a[i];          for (; j >= 0 && temp < a[j]; j -= d) {            a[j + d] = a[j];          }          a[j + d] = temp;        }      }      if (d == 1) {        break;      }    }    System.out.println(Arrays.toString(a));  }}