希尔排序(Java实现)

import java.util.Arrays;

public class ShellSort {
	
	public static void main(String[] args)	{	
		
		int[] arr = {2,3,5,1,7,10,6,13,4,80,13,90,8,15,20};	
		
		System.out.println(Arrays.toString(shellSort(arr)));		
	
	}
	
	public static int[] shellSort(int[] arr){		
		
		for(int gap=arr.length;gap>0;gap/=2){
			
			for(int i=gap;i<arr.length;i++){
				
				if(arr[i-gap]>arr[i]){
					
					int temp=arr[i];
					int j;
					
					for(j=i-gap;j>=0&&arr[j]>temp;j-=gap){
						
						arr[j+gap]=arr[j];
						
					}
				
					arr[j+gap]=temp;
					
				}
			}
			
		}
		
		return arr;
	
	}
			

}