排序_希尔排序

void shellSort(LineList R[], int n)
{
    int i, j, d;
    d = n / 2;

    while (d > 0)
    {
        for (i = d + 1; i <= n; i++)
        {
            if (R[i].key < R[i - d].key)
            {
                R[0].key = R[i].key;
                for (j = i - d; j > 0 && R[0].key < R[j].key; j = j - d)
                {
                    R[j + d] = R[j];
                }
                R[j + d] = R[0];
            }
        }
        d = d / 2;
    }
}

下标从0开始的算法如下：

void insertSort(ElementType A[], int N)
{
    int p, i;
    ElementType tmp;

    /* 希尔增量序列 */
    for (D = N / 2; D > 0; D /= 2)
    {
        /* 插入排序 */
        for (p = D; p < N; p++)
        {
            tmp = A[p];
            for (i = p; i >= D && A[i - D] > tmp; i -= D)
            {
                A[i] = A[i - D];
            }

            A[i] = tmp;
        }
    }
}

另外还有sedgewick序列的方法

void ShellSort( ElementType A[], int N )
{ 
     /* 希尔排序 - 用Sedgewick增量序列 */
     int Si, D, p, i;
     ElementType tmp;

     /* 这里只列出一小部分增量 */
     int Sedgewick[] = {929, 505, 209, 109, 41, 19, 5, 1, 0};
      
     for ( Si = 0; Sedgewick[Si] >= N; Si++ ) 
         ; /* 初始的增量Sedgewick[Si]不能超过待排序列长度 */
 
     for ( D = Sedgewick[Si]; D > 0; D = Sedgewick[++Si] )
    {
        /* 插入排序*/
         for ( p = D; p < N; p++ ) 
        { 
             tmp = A[P];
             for ( i = p; i >= D && A[i - D] > tmp;  i -= D )
            {
                 A[i] = A[i-D];
            }
             A[i] = tmp;
         }
    }
}