归并排序MergeSort

#include <stdio.h>

/*归并排序会使用额外空间，空间大小于数组a相当，空间复杂度为O(n)
 * 最好，最坏，平均时间复杂度都为O(nlogn)*/

void Merge(int *a, int low, int mid, int high, int *b) {
    int p1 = low;//指向前半部分待插入的元素
    int p2 = mid + 1;//指向后半部分待插入的元素
    int cur = p1;//cur为b数组当前需要更新的位置
    while (p1 < mid + 1 && p2 < high + 1) {//元素全部插入b
        if (a[p1] < a[p2]) {
            b[cur] = a[p1];
            p1++;
        } else {
            b[cur] = a[p2];
            p2++;
        }
        cur++;
    }
    //再将剩下的元素放入,可能会出现剩下好几个元素的情况，如35,65,0，故应用while将元素全部放入
    while(p1<mid+1){
        b[cur++]=a[p1++];
    }
    while(p2<high+1){
        b[cur++]=a[p2++];
    }

   
    //对a数组进行更新
    for (int i = 0; i < high + 1; ++i) {
        a[i] = b[i];
    }
}

void MergeSort(int *a, int low, int high, int *b) {
    if (high > low) {
        int mid = (low + high) / 2;
        MergeSort(a, low, mid, b);
        MergeSort(a, mid + 1, high, b);
        Merge(a, low, mid, high, b);
    }
}


int main() {
    int a[13] = {49, 24, 11, 223, 44, 55, 675, 321, 1, 23, 44, 56, 221};
    int b[13] = {0};//辅助空间
    MergeSort(a, 0, sizeof a / sizeof a[0] - 1, b);
    printf("after Merge sort\n");
    for (int i = 0; i < sizeof a / sizeof(a[0]); ++i) {
        printf("%-4d", a[i]);
    }

    return 0;
}