2希尔排序的算法 void shell_sort(int r[N+dIl, int d(tD) i int I, j, k, h; rectype temp for(i=0; i<d[O]; i++) Ri]. key =-maxint h=dk;/*取本趟增量* for(i=h+d1;i<n+dl;i++)//按增量分组将数据插入有序区 i temp=R[i;j=i-h while(temp. key <RG. key)( Ri+]=Rel;j=j-h;) RU+h=temp; K++ 3 while(h!=1)2.希尔排序的算法 void shell_sort(int R[N+d1],int d[t]) { int I,j,k,h; rectype temp; for(i=0; i<d[0];i++) R[i].key = - maxint; k = 0; do { h=d[k]; /*取本趟增量*/ for ( i=h+d1; i<n+d1; i++) //按增量分组将数据插入有序区 { temp=R[i]; j = i-h; while ( temp.key < R[j].key) { R[j+h] = R[j]; j = j –h; } R[j+h] = temp; } K++； } while ( h!=1); }