/*希尔排序算法*/

/*希尔排序算法*/void ShellInsert( Sqlist &L , int dk ) //实现插入操作{ /*L为链表，dk为递增序列*/for( i = dk + 1 ; i <= L.length()  ; i ++ )if(LT(L.r[i].key , L.r[i-dk]).key){L.r[0] = L.r[i] ;for( j = i - dk ; j > 0 && LT(L.r[0].key,L.r[j].key) ; j -=dk)L.r[j+dk] = L.r[j] ;L.r[j+dk] = L.[0] ;}}void ShellShort(Sqlist &L , int dlta[] , int t ){for( k = 0 ; k < t ; k ++)ShellInsert(L,dlta[k]);}