归并排序

   归并排序

   递归实现方法异常简单，先实现归并过程，把两个有序的子序列合并为一个有序整体。

  （1）递归划分：将原序列进行划分为两半，每半再划分为两半，不断递归划分，直到单个元素。

  （2）递归合并：将单个元素视为有序序列，两两合并，然后将得到的有序序列两两合并，直到整体有序。

#include <iostream>
using namespace std;

//Two-way merge with sections [beg,mid) and [mid, end) sorted increasingly
//tmpArray is the extra space cost to store the merge result
//and will be copied back to myArray
void merge(int myArray[], int tmpArray[], int beg, int mid, int end)
{
	int i = beg,j = mid,ind = beg;
	while((i < mid) && (j < end))
	{
		if(myArray[i] < myArray[j])
			tmpArray[ind++] = myArray[i++];
		else
			tmpArray[ind++] = myArray[j++];
	}
	while(i < mid)
		tmpArray[ind++] = myArray[i++];
	while(j < end)
		tmpArray[ind++] = myArray[j++];
	for(int k = beg; k < end; k++)
		myArray[k] = tmpArray[k];
}

void mergeSort(int myArray[], int tmpArray[], int beg, int end)
{
	//return when only one element is left
	if(beg + 1 == end)
		return;
	//divide into two half
	int mid = (beg + end)/2;
	mergeSort(myArray, tmpArray, beg, mid);
	mergeSort(myArray, tmpArray, mid, end);
	//merge the two half
	merge(myArray, tmpArray, beg, mid, end);
}

int main(void)
{
	int myArray[8] = {3,1,4,6,7,12,8,11};
	int tmpArray[8] = {0};
	mergeSort(myArray, tmpArray, 0, 8);
	for(int i = 0; i < 8; i++)
		cout<<myArray[i]<<" ";
	cout<<endl;
	return 0;
}