归并排序代码

int *B = (int *)malloc(sizeof(int *) * 20);
void merge(int A[], int low, int mid, int high)
{ // 一次归并排序
    int k, m, n;
    for (int i = low; i <= high; i++)
    {
        B[i] = A[i];//将A中元素复制到B中
    }

    for (m = low, n = mid + 1, k = m; m <= mid && n <= high;)
    {
        //比较B的左右两端中的元素
        if (B[m] <= B[n])
        {
            A[k++] = B[m++];//较小值赋值到A中
        }
        else
        {
            A[k++] = B[n++];
        }
    }
    while (n <= high)//若第一个表未检测完，复制
        A[k++] = B[n++];
    while (m <= mid)
        A[k++] = B[m++];
}
void mergeSort(int A[], int low, int high)
{
    if (low < high)
    {
        int mid = (low + high) / 2;//从中间划分两个子序列
        mergeSort(A, low, mid);//左子序列递归排序
        mergeSort(A, mid + 1, high);//右子序列递归排序
        merge(A, low, mid, high);//归并
    }
}