JAVA implementation using to achieve Hill sorting exchange

JAVA implementation using to achieve Hill sorting exchange

package cm.zc;

import java.util.Arrays;

/**
 * 希尔排序采用交换法实现
 * @author D
 *
 */
public class ShellSort {
	public static void main(String[] args) {
		int [] arr= {8,9,1,7,2,3,5,4,6,0};
		shellSort(arr);
		System.out.println(Arrays.toString(arr));
	}
	
	public static void shellSort(int[] arr) {
		int 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;
					}
				}
			}
		}
	}
}