希尔排序java.zip

package com.eastcom.test; ###### public class ShellSort { @SuppressWarnings("unchecked") public void sort(Comparable[] data, int length) { int step, out, in; for (step = length / 2; step >= 1; step /= 2) { for (int i = 0; i < step; i++) { //插入排序 for (out = step + i; out < data.length; out += step) { Comparable temp = data[out];//暂存变量 in = out; //选出data[out]元素的插入位置 while(in >= step&&data[in-step].compareTo(temp)>0){ data[in] = data[in - step]; in -= step; } data[in] = temp; }//end for 插入排序结束 } } } @SuppressWarnings("unchecked") public void print(Comparable[] data){ for(int i=0;i<data.length;i++){ if( i == data.length-1){ System.out.println(data[i]); }else{ System.out.print(data[i]+","); } } } @SuppressWarnings("unchecked") public static void main(String[] args){ Comparable[] data = {10,32,1,9,5,7,12,0,4,3,100,220,234,23,45,89,8}; ShellSort shellSort = new ShellSort(); shellSort.sort(data, data.length); shellSort.print(data); } }