归并排序

void sort(int *nums, int l, int mid, int r){
    int *tmp, i, lsub, rsub, len;

    len = r-l+1;
    lsub = l;
    rsub = mid+1;

    tmp = malloc(sizeof(int) * len);
    for (i = 0; i<len; ++i) {
        if (lsub > mid) {
            tmp[i] = nums[rsub++];
            continue;
        }
        if (rsub > r){
            tmp[i] = nums[lsub++];
            continue;
        }
        if (nums[rsub] > nums[lsub]) {
            tmp[i] = nums[lsub++];
            continue;
        } else {
            tmp[i] = nums[rsub++];
            continue;
        }
    }
    for(i=0; i<len; ){
        nums[l++] = tmp[i++];
    }
}
void mergeSort(int *nums, int numsSize, int l, int r){
    if (l>=r){return;}
    int mid;
    mid = (l+r)/2;

    mergeSort(nums, numsSize, l, mid);
    mergeSort(nums, numsSize, mid+1, r);
    sort(nums, l, mid, r);
}
/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* sortArray(int* nums, int numsSize, int* returnSize){
    int l, r, mid;
    int *returnNums;
    returnNums = malloc(sizeof(int) * numsSize);
    memcpy(returnNums, nums, sizeof(int) * numsSize);
    mid = numsSize/2;
    *returnSize = numsSize;
    mergeSort(returnNums, numsSize, 0, numsSize-1);
    return returnNums;
}