归并排序

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 = malloc(N*sizeof(ELementTYpe));
    if (TmpArray != NULL) {
        MSort(A, TmpArray, 0, N-1);
        free(TmpArray);
    }
}

void Merge(ElementType A[]; ElementType TmpArray[]; int Lpos; int Rpos; int RightEnd) {
    int i, LeftEnd, NumElements, TmpPos;
    LeftEnd = Rpos - 1;
    TmpPos = Lpos;
    NumElements = RightEnd - Lpos + 1;

    while (Lpos<=LeftEnd && Rpos<=RightEnd) {
        if (A[Lpos]<=A[Rpos]) {
            TmpArray[TmpPos++] = A[LPos++];
        }
        else {
            TmpArray[TmpPos++] = A[Rpos++]
        }
    }

    while (Lpos <= LeftEnd) {
        TmpArray[TmpPos++] = A[Lpos++];
    }
    while (Rpos <+ RightEnd) {
        TmpArray[TmpPos++] = A[Rpos++];
    }

    for (i=0; i<NumElements; i++,RightEnd--) {
        A[RightEnd] = TmpArray[RightEnd];
    }
}