基本思想:
先取一个小于n的整数d1作为第一个增量,把文件的全部记录分成d1个组。所有距离为dl的倍数的记录放在同一个组中。先在各组内进行直接插人排序;然后,取第二个增量d2<d1重复上述的分组和排序,直至所取的增量dt=1(dt<dt-l<…<d2<d1),即所有记录放在同一组中进行直接插入排序为止。 该方法实质上是一种分组插入方法。
import java.util.Random;
/**
* Shell sort in Java.
* @author Sun Kui
*/
public class ShellSort {
private long[] theArr;
private int nElems;
public ShellSort(int max) {
theArr = new long[max];
nElems = 0;
}
public void insert(long value) {
theArr[nElems++] = value;
}
public void display() {
System.out.print("A=");
for (int j = 0; j < nElems; j++) {
System.out.print(theArr[j] + " ");
if (j % 10 == 0) {
System.out.println();
}
}
System.out.println();
}
public void shellSort() {
int inner, outer;
long temp;
// select increment in, start from 1
int h = 1;
while(h <= nElems / 3) {
h = h * 3 + 1;
}
while (h > 0) {
for (outer = h; outer < nElems; outer++) {
temp = theArr[outer];
inner = outer;
while (inner > h - 1 && theArr[inner - h] >= temp) {
theArr[inner] = theArr[inner - h];
inner -= h;
}
theArr[inner] = temp;
}
// decrease increment in each step
h = (h - 1) / 3;
}
}
public static void main(final String... args) {
Random rand = new Random();
ShellSort ss = new ShellSort(100);
for (int i = 0; i < 100; i++) {
ss.insert(rand.nextInt(10000));
}
ss.shellSort();
ss.display();
}
}
end