912. 排序数组

void quickSort(int *nums, int n, int i, int j) {
    int base, tmp, this_begin,  this_end;
    if (i<0 || j >= n) 
        return;
    if (i >= j) 
        return ;
    this_begin = i;

    this_end = j;
    base = nums[i];
    while (i < j) {
        while (i<j && nums[j] >= base)--j;
        nums[i] = nums[j];
        while (i<j && nums[i] < base) ++i;
        nums[j] = nums[i];
    }
    nums[i] = base;
#if 0
    int k;
    for(k=0; k<n; ++k)
        printf("%d ", nums[k]);
    printf("
");
#endif
    if (i == j) ++j;
    quickSort(nums, n, this_begin, i);
    quickSort(nums, n, j, this_end);
}
/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* sortArray(int* nums, int numsSize, int* returnSize){
    *returnSize = numsSize;
    int *returnNums;
    
    if (nums == NULL) 
        return NULL;
    returnNums = malloc(sizeof(int) * numsSize);
    memcpy(returnNums, nums, sizeof(int) * numsSize);
    
    if (numsSize <= 1) 
        return nums;
    
    quickSort(returnNums, numsSize, 0, numsSize - 1);
    return returnNums;
}