算法学习——归并排序

---

归并排序

一、实现思路

以有序数据之间的归并为基础，采用分治的策略，即将一组无序的待排数据拆解成两部分进行归并，并且对被拆解的两部分进行递归式求解。由递归的写法中我们无需关心具体每一步分执行的过程，只需当作他返回了正确的有序解。

二、代码实现

void merger(int left, int right)
{
    int mid = (left + right) / 2;
    int p1 = left;
    int p2 = mid + 1;
    int p = left;
    while(p1 <= mid && p2 <= right){
        while(num[p1] <= num[p2] && p1 <= mid && p2 <= right){
            temp[p++] = num[p1++];
        }
        while(num[p2] < num[p1] && p1 <= mid && p2 <= right){
            temp[p++] = num[p2++];
        }
    }
    while(p1 <= mid){
        temp[p++] = num[p1++];
    }
    while(p2 <= right){
        temp[p++] = num[p2++];
    }
    for(int i = left; i <= right; i++){
        num[i] = temp[i];
    }
}

void mergerSort(int left, int right)
{
    if(left == right){
        return ;
    }
    int mid = (left + right) / 2;
    mergerSort(left, mid);
    mergerSort(mid + 1, right);
    merger(left, right);
}

注意事项

• 要保证归并排序的稳定性，需要注意一下归并过程中符号问题