插入排序算法-希爾排序

package com.larry.sorting;

import java.util.Arrays;

/**
 * 希爾排序（從小到大）
 * @author admin
 *
 */
public class HillSort {
	private int[] hillSort(int array[]){
		int n = array.length;
		if(n == 0 || n == 1) return array;
		
		//希爾排序核心算法
		for(int d = n/2; d >=1; d = d/2){
			for(int i = d; i < n; i++){
				int sym = array[i];
				for(int j = i-d; j > 0; j = j-d){
					if(sym < array[j]) array[j+d] = array[j];
					else{
						array[j+d] = sym;
						break;
					}
				}
			}
		}
		
		return array;
	}
	public static void main(String[] args) {
		int array[] = {};
		//int array[] = {1};
		//int array[] = {1, 2, 3, 7, 5, 5, 11};
		System.out.println(Arrays.toString(new HillSort().
				hillSort(array)));
	}
}