Shell排序

 public void shellSort(int[] array) {
         int increment = array.length;
         do {
             increment = increment / 2; // 增量序列
             for (int i = increment; i < array.length; i++) {
                 if (array[i] < array[i - increment]) {
                     int guard = array[i];
                     int j;
                     for (j = i - increment; (j >= 0) && (guard < array[j]); j -= increment) // 记录后移，查找插入位置
                     {
                         array[j + increment] = array[j];
                     }
                     array[j + increment] = guard; // 插入
                 }
             }
         } while (increment > 1);
         for (int i = 0; i < array.length; i++) {
             System.out.println(array[i]);
         }
     }