用Java實現希爾排序

package ch10;public class ShellInsertSort {/** * 希爾排序 * @param <T> * @param t：待排序數組 * @param dlta：增量數組 * @return */public static <T extends Comparable> boolean shellSort(T[] t, int[] dlta){if(t==null || t.length<=1) return true;for(int i = 0; i<dlta.length; i++){if(!shellInsert(t, dlta[i])){return false;}}return true;}/** * 一趟希爾排序 * @param <T> * @param t：待排序數組 * @param dk:增量 * @return */private static <T extends Comparable> boolean shellInsert(T[] t, int dk){if(t==null || t.length <= dk) return true;for(int i = dk; i<=t.length-1 ;i++){if(t[i].compareTo(t[i-dk]) < 0 ){T temp = t[i];int j;for(j = i-dk; j>=0 && temp.compareTo(t[j])<0; j-=dk){t[j+dk] = t[j];}t[j+dk] = temp;}}return true;}public static void main(String[] args) {Integer[] arr = new Integer[]{3,5,2,1,7,9,8,1,1,1,1};int[] dlta = new int[]{5,3,1};ShellInsertSort.shellSort(arr, dlta);for(int i : arr){System.out.println(i);}}}