package sort;
/**
*
* @author dreamtry
*
* Shell排序是以以一个量(sequence) 递减的以步长(step)序列的排序,我这里设的step为6,
* 所以第一趟分别为子数列(0,6)(1,7)(2,8)(3,9)(4,10)...分别进行排序
* 第二趟因为sequence为1,所以同插入排序
*
*/
public class ShellSort {
public void shellSort(int[] arr, int step){
int min;
int temp;
int sequence =1;
while(sequence < arr.length/step){
sequence = sequence*step +1; //产生到以step为步长到arr.length的最大值.
}
while(sequence > 0){
for(int i = sequence; i < arr.length; i++){
temp = arr[i];
min = i;
while(min > sequence -1 && arr[min-sequence] > temp){
arr[min] = arr[min-sequence];
min = min - sequence;
}
arr[min] = temp;
}
sequence = (sequence-1)/step; //递减序列关键字
}
}
public void print(int arr[]){
for(int i=0; i<arr.length; i++){
System.out.print(arr[i] + " ");
}
}
/**
* @param args
*/
public static void main(String[] args) {
int[] arr = {24,3,5,23,53,1,22,13,7,16,10,4};
System.out.print(arr.length +"\n");
int step = 5;
ShellSort demo = new ShellSort();
demo.shellSort(arr, step);
demo.print(arr);
}
}
/**
* 个人总结:shell排序当最后sequence=1时同插入排序,是插入排序的一种扩展,有错请指正
*/