希尔排序

 

 代码：

package PaiXu;

import java.util.Scanner;

public class XiErPaiXu {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int arr[]=new int [n];
        for(int i=0;i<arr.length;i++){
            arr[i]=sc.nextInt();
        }
        XiEr(arr,arr.length);
    }


    public static void XiEr(int arr[], int length){
        int size=length;
        while(size/2!=0){
            for(int i=0;i<length-size;i++){
                if(arr[i]>arr[i+size]){
                    int temp=arr[i];
                    arr[i]=arr[i+size];
                    arr[i+size]=temp;
                }
                //每次size缩小一半
                size=size/2;
            }
        }
    }
}