希尔排序

#include<stdio.h>
#include<windows.h>
int a[20];
void incrementSort(int n){
   int increment = n;
   while(increment>1){

       printf("\nincrement:%d\n",increment);
       increment=increment/3+1;
       for(int i=increment+1;i<=n;i++){
            if(a[i]<a[i-increment]){
               a[0]=a[i];
               int j;
               for(j=i-increment;j>=1&&a[j]>a[0];j-=increment){
                  a[j+increment]=a[j];
               }
               a[j+increment]=a[0];
            }
       }
       for(int i=1;i<=10;i++){
        printf("%d ",a[i]);
    }
    printf("\n");
    system("pause");
    }

}

int main(){
  int n;
  scanf("%d",&n);
  for(int i=1;i<=n;i++){
    scanf("%d",&a[i]);
  }
  incrementSort(n);
  for(int i=1;i<=n;i++){
    printf("%d ",a[i]);
  }
}