希尔排序（Shell Sort）

#include<cstdio>
#include<algorithm>
using namespace std;
#define MAXN 100000
int A[MAXN];
int N;
void Shell_sort(){
int i;
int temp;
for(int D = N / 2; D > 0; D /= 2){  //希尔排序
for(int P = D; P <= N ; P++){   //插入排序
temp = A[P];
for(i = P; i > D && A[i - D] > temp; i -= D)
A[i] = A[i - D];
A[i] = temp;
}
}

for(int i = 1 ; i <= N; ++i){
if(i == 1)
printf("%d", A[i]);
else
printf(" %d", A[i]);
}

}

int main(void){
scanf("%d", &N);
for(int i = 1;i <= N; ++i)
scanf("%d", &A[i]);
Shell_sort();

return 0;
}