补充之前博客的几种排序--希尔排序、堆排序、归并排序

希尔排序代码如下：

void Shellsort(ElementType A[], int N){
    int i, j, Increment;
    ElementType Tmp;

    for(Increment=N/2; Increment>0; Increment/=2){
        for(i=Increment; i<N; i++){
            Tmp = A[i];
            for(j=i-Increment; j>=0 && A[j]>Tmp; j-=Increment)
                A[j+Increment] = A[j];
            A[j+Increment] = Tmp;
        }
    }
}

堆排序：

#define LeftChild(i) (2*(i)+1)

void PercDown(Element A[], int i, int N){
    int Child;
    ElementType Tmp;

    for(Tmp=A[i]; LeftChild(i)<N; i=Child){
        Child = LeftChild(i);
        if(Child+1<N && A[Child+1] > A[Child])
            Child++;
        if(Tmp < A[Child])
            A[i] = A[Child];
        else
            break;
    }
    A[i] = Tmp;
}

void HeapSore(ElementType A[], int N){
    int i;
    for(i=N/2; i>=0; i--){
        PercDown(A, i, N);
    }
    for(i=N-1; i>0; i--){
        swap(&A[0], &A[i]);
        PercDown(A, 0, i);
    }
}

归并排序实现代码如下：

void MSort(ElementType A[], ElementType TmpArray[], int Left, int Right){
    int Center;
    if(Left < Right){
        Center = (Left + Right)/2;
        MSort(A, TmpArray, Left, Center);
        MSort(A, TmpArray, Center+1, Right);
        Merge(A, TmpArray, Left, Center+1, Right);
    }
}

void MergeSort(ElementType A[], int N){
    ElementType *TmpArray;

    TmpArray = malloc(N*sizeof(ElementType));
    MSort(A, TmpArray, 0, N-1);
    free(TmpArray);
}