The Program of Algorithms ------- Diveide and Conquer ---- Merge Sort

Merge Sort:

1. Divide:     Divide the input array into two subarray(n/2 and n/2).

2. Conquer: Recursively sort each subarray.

3. Combine: Linear-Time merge.

 

Running Time:  T(n)=2T(n/2)+Θ(n).

                         Solution: Master Method case2. T(n)=O(nlgn)

 

Realization ----  CPP code:

namespace MERGE{
	const int INFINITE=0xFFFFFFFF;
	void Merge(int* Arr,int p,int q,int r){//Combine
		int len_l=q-p+1;
		int len_r=r-q;
		int *LeftArr=new int[len_l+1];
		int *RightArr=new int[len_l+1];
		int i,j;
		for(i=0;i<len_l;i++){
			LeftArr[i]=Arr[p+i];
		}
		for(j=0;j<len_r;j++){
			RightArr[j]=Arr[q+j+1];
		}
		LeftArr[i]=INFINITE;
		RightArr[j]=INFINITE;

		int k_l=0,k_r=0,k=0;
		while(LeftArr[k_l]!=INFINITE&&RightArr[k_r]!=INFINITE){
			if(LeftArr[k_l]<RightArr[k_r]){
				Arr[p+k]=LeftArr[k_l];
				k_l++;
			}else{
				Arr[p+k]=RightArr[k_r];
				k_r++;
			}
			k++;
		}
		while(LeftArr[k_l]!=INFINITE){
			Arr[p+k]=LeftArr[k_l];
			k_l++;
			k++;
		}
		while(RightArr[k_r]!=INFINITE){
			Arr[p+k]=RightArr[k_r];
			k_r++;
			k++;
		}
		delete LeftArr;
		delete RightArr;
	}

	void MergeSort(int* Arr,int p,int r){	//Divide
		if(p<r){
			int q=(p+r)/2;
			MergeSort(Arr,p,q);
			MergeSort(Arr,q+1,r);
			Merge(Arr,p,q,r);
		}
	}
}