顺序表合并问题 指针 和 元素 的比较和负值

Question

Answer 1

这个就是归并排序里面合并数组的过程啊.

//合并有序数组
void mergeArray(int* arr, int left, int mid, int right, int* temp)
{
    int i = left, j = mid + 1;
    int k = 0;
    while(i <= mid && j <= right) {
        if(arr[i] < arr[j]) {
            temp[k++] = arr[i++];
        } else {
            temp[k++] = arr[j++];
        }
    }
    while(i <= mid) {
        temp[k++] = arr[i++];
    }
    while(j <= right) {
        temp[k++] = arr[j++];
    }
    for(int p = 0; p < k; p++) {
        arr[left + p] = temp[p];
    }
}