希尔排序（JAVA）

package sort20171111;

import java.util.Scanner;

public class Shell {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        
        int []a = new int[5];
        int n;
        Scanner in = new Scanner(System.in);
        n = in.nextInt();
        for(int i = 0; i < n; i++) {
            a[i] = in.nextInt();
        }
        
        //希尔排序
        int h = 1;
        while(h < n / 3) {
            h = h * 3 + 1;
        }
        while(h >= 1) {
            for(int i = h; i < n; i++) {
                for(int j = i; j >= h; j = j - h) {
                    if(a[j] < a[j - h]) {
                        int temp;
                        temp = a[j];
                        a[j] = a[j - h];
                        a[j - h] = temp;
                    }
                }
                h = h / 3;
            }
        }
        
        for(int i = 0; i < n; i++) {
            System.out.println(a[i]);
        }
        

    }

}