java希爾排序

package com.zz.sort;

import java.util.Random;

public class ShellSort {
	public static void main(String[] args) {
		//int[] iArraya = new int[]{10,1,8,54,23,51,15};
		int iLong = 1000;
		int[] iArrgs = new int[iLong];
		Random random = new Random(); 
		for(int i = 0; i < iLong; i++) {
			iArrgs[i] = random.nextInt(iLong);
		}
		
		ShellSort shellSort = new ShellSort();
		shellSort.shellSort(iArrgs);
		for(int i = 0; i < iArrgs.length; i++) {
			System.out.print(iArrgs[i] + " ");
		}
	}
	
	/**
	 * 
	 * @param iArray
	 */
	private void shellSort(int[] iArray) {
		int iLength = iArray.length; //數組長度
		int d = iLength / 2 ; //步長
		while(d > 0) { //根據步長調整順序，當d=1，就排序.
			//無序
			for(int i = d; i < iLength; i++) {
				int temp = iArray[i];
				int j;
				//有序
				for(j = i - d; j >= 0 && iArray[j + d] <  iArray[j]; j = j-d) { //
					iArray[j + d] = iArray[j];
				}
				iArray[j + d] = temp;
			}
			d = d  / 2;//縮小一半補償
		}
	}
}