Java数据结构与算法笔记——希尔排序

import java.util.Arrays;

public class ShellSort {
	public static void main(String[] args) {
		int[] arr = { 8, 9, 1, 7, 3, 4, 5, 2, 6, 0 };
		shellSort(arr);
	}

	public static void shellSort(int[] arr) {
		int count=0,temp=0;
		for (int gap = arr.length / 2; gap > 0; gap /= 2) {
			for (int i = gap; i < arr.length; i++) {
				for (int j = i - gap; j >= 0; j -= gap) {
					if (arr[j] > arr[j + gap]) {
						temp = arr[j];
						arr[j] = arr[j + gap];
						arr[j + gap] = temp;
					}
				}
			}
			System.out.println("希尔排序第"+(++count)+"轮"+Arrays.toString(arr));
		}
		
	}
}