归并排序 C++

归并排序思路

• Divide and Conquer
• A[0…n] = A[0…mid] + A[mid…n-1]
  • mid 的划分方法可以用随机或者直接 1/2
  • 相对于插入排序，划分次数变少了，复杂度也就相应降下来了
• 求原问题的排序，就是求子问题的排序，然后将子问题的解 merge
• 性能不受输入数据的影响，始终为O(nlogn)

代码框架
MergeSort(A, l, r){
	if(l < r){
		int mid = l + 0.5(r-l);
		MergeSort(A, l, mid);
		MergeSort(A, ?p,r);
		Nerge(A, l, mid, r);
	}
}

• 关键点就在于实现 merge 函数，将两个排好序的小数组，从小到大依次比较，小的放入结果数组

归并排序实现

• merge A[l…m],A[m+1…r]，compare in temp_v, but operate in original v
• Alternatively, create two temporary array to maintain L array and R array
• compare R and L, place elements in v in right place
• because R and L is sorted, when one has been merged, add the remainer directly into the original array

#include<iostream>
#include<vector>
using namespace std;

void MergeSortHelper(vector<int> &v, int l, int mid, int r){
    int L_low = l,R_low = mid+1;
    vector<int> temp_v(v);//copy
    int k = l;
    while(L_low <= mid && R_low <= r){
        if(temp_v[L_low] < temp_v[R_low]){
            v[k++] = temp_v[L_low];
        }else{
            v[k++] = temp_v[R_low++];
        }
    }
    while(L_low <= mid){
         v[k++] = temp_v[L_low++];
    }
    while(R_low <= r){
        v[k++] = temp_v[R_low++];
    }
    temp_v.clear();
}
void MergeSort(vector<int>& v, int l, int r){
    if(l < r){
        int mid = l + 0.5*(r-l);
        MergeSort(v,l,mid);
        MergeSort(v,mid+1,r);
        MergeSortHelper(v,l,mid,r);
    }
}
int main(){
    vector<int> v{1,3,8,5,7,4};
    MergeSort(v,0,v.size()-1);
    for(int val:v)
        cout<<val<<" ";
    return 0;
}