高级排序-希尔排序

package g_advancedSort.A_shellSort;


public class ArraySh {
private long[] theArray;
private int nElems;


public ArraySh(int max) {
theArray = new long[max];
nElems = 0;
}


public void insert(long value) {
theArray[nElems++] = value;
}


public void displays() {
System.out.print("A = ");
for (int i = 0; i < nElems; i++) {
System.out.print(theArray[i] + " ");
}
System.out.println();
}


/**
* 希尔排序
*/
public void shellSort() {
int inner, outer;
long temp;
int h = 1;// 初始值
while (h <= nElems / 3) {// 获取数据项之间的间隔
h = h * 3 + 1;// 4,13
}
while (h > 0) {
for (outer = h; outer < nElems; outer++) {
temp = theArray[outer];
inner = outer;
while (inner > h - 1 && theArray[inner - h] >= temp) {
theArray[inner] = theArray[inner - h];
inner -= h;
}
theArray[inner] = temp;
}
h = (h - 1) / 3;
}
}


} package g_advancedSort.A_shellSort;


/**
 * 希尔排序
 * 
 * @author Administrator
 *
 */
public class ShellSortApp {
public static void main(String[] args) {
int maxSize = 10;
ArraySh arraySh = new ArraySh(maxSize);
for (int i = 0; i < maxSize; i++) {
long n = (int) (Math.random() * 99);
arraySh.insert(n);
}
arraySh.displays();
arraySh.shellSort();
arraySh.displays();


}
}