자바 힐 정렬(최소 코드)

package com.cn.sort;

public class ShellSort {
	public void shellSort(int[] array, int n) {
		int i, j, gap;
		int temp;
		for (gap = n / 2; gap > 0; gap /= 2) {//   gap  
			for (i = gap; i < n; i++) {//        
				for (j = i - gap; j >= 0 && array[j] > array[j + gap]; j -= gap) {//            
					temp = array[j];
					array[j] = array[j + gap];
					array[j + gap] = temp;
				}
				//         
				for (int m = 0; m <= array.length - 1; m++) {
					System.out.print(array[m] + "\t");
				}
				System.out.println();
			}
		}
	}

	public static void main(String[] args) {
		ShellSort shellSort = new ShellSort();
		int[] array = { 5, 69, 12, 3, 56, 789, 2, 5648, 23 };
		shellSort.shellSort(array, array.length);//         
		for (int m = 0; m <= array.length - 1; m++) {
			System.out.print(array[m] + "\t");
		}
	}
}