[算法]ShellSort的Java实现

public class ShellSort {

	public static void main(String[] args) {
		int[] arr = {13,4,5,6,8,9,5,8,96,17,23};		
		sort(arr);
		String output = "";
		for (int i:arr) {
			output += i + ",";
		}
		System.out.println(output);

	}
	private static void sort(int[] nums) {
		int N = nums.length;
		int h = 1;
		while (h < N) h = h * 3 + 1;
		while (h >= 1) {
			for (int i = h; i < N; i++) {
				for (int j = i; j >= h && nums[j] < nums[j - h]; j -= h ) {
					swap(nums, j, j - h);
				}
			}
			h = h / 3;
		}
	}
	private static void swap(int[] nums, int a, int b) {
		int temp = nums[a];
		nums[a] = nums[b];
		nums[b] = temp;
	}

}