Java实现希尔排序

import java.util.Scanner;
public class Main{
    public static Scanner cin=new Scanner(System.in);
    public static void main(String[] arg){
        int n=cin.nextInt();
        int[] a=new int[n];
        for(int i=0;i<n;++i) a[i]=cin.nextInt();
        int m=cin.nextInt();
        do{
            int ic=cin.nextInt();
            for(int i=ic;i<n;++i){
                int tmp=a[i],j=i-ic;
                while(j>=0&&a[j]>tmp){
                    a[j+ic]=a[j];
                    j-=ic;
                }
                a[j+ic]=tmp;
            }
            for(int i=0;i<n;++i){
                System.out.print(a[i]);
                System.out.print(i<n-1?' ':'\n');
            }
        }
        while(--m>0);
        return;
    }
}