java实现希尔排序算法

//带增量的插入排序
public static void shellSort(int[] array) {
    int len = array.length;
    int h = 1;
    while (h < len)
      h = h * 3 + 1;
    while (h >= 1) {
      for (int i = 1; i < len; i++) {
        for (int j = i; j >= h; j = j - h) {
          if (array[j] < array[j - h]) {
            Sort.swap(array, j, j - h);//交换j和j-h
          } else
            break;
        }
      }
      h = h / 3;
    }
  }