package com.echo.shell;
public class ShellSort {
private static int[] data ={97,18,5,20,49,34,8,16,45,9,21};
public static void main(String[] args) {
ShellSort shellSort = new ShellSort();
int[] data = shellSort.getData();
//distant:希尔排序步长,也是希尔分组数
for (int distant = data.length/3; distant >=1; distant/=3) {
//对每一个组开始排序,start表示分组号
for (int start = 0; start < distant; start++) {
//组内排序,按组进行按步长的直接插入排序
shellSort.insertSort(data,start, distant);
}
}
}
/**
*
* @param data 要排序的数组
* @param start 分组号
* @param inc 步长
*/
public void insertSort(int[] data,int start,int inc) {
//i:组内元素的下标
for (int i=start+inc;i<data.length;i+=inc) {
for (int j = i; j >=inc; j-=inc) {
if (data[j]<data[j-inc]) {
int temp = data[j];
data[j]=data[j-inc];
data[j-inc] = temp;
}
}
}
}
}