算法排序之归并排序

#include <iostream>
using namespace std;

void mergeArray(int *a, int first, int mid, int last, int *temp)
{
	int i = first;
	int j = mid + 1;
	int m = mid;
	int n = last;
	int k = 0;
	while (i<=m && j<=n)
	{
		if (a[i]<=a[j])
		{
			temp[k++] = a[i++];
		}
		else
		{
			temp[k++] = a[j++];
		}
	}
	while (i<=m)
	{
		temp[k++] = a[i++];
	}
	while (j<=n)
	{
		temp[k++] = a[j++];
	}
	for (i = 0; i < k;i++)
	{
		a[first + i] = temp[i];
	}
}
void mergeSort(int *a, int first,int last, int *temp)
{
	if (first<last)
	{
		int mid = (first + last) / 2;
		mergeSort(a, first, mid, temp);
		mergeSort(a, mid + 1, last, temp);
		mergeArray(a, first, mid, last, temp);
	}
}
bool MergeSort(int *a, int n)
{
	int *p = new int[n];
	if (p == NULL)
	{
		return false;
	}
	mergeSort(a, 0, n-1, p);
	delete[] p;
	return true;
}

int main(int argc, char *argv[])
{
	int a[10] = {5,3,4,8,6,1,2,9,7,10};
	MergeSort(a, 10);
	for (int i = 0; i < 10;i++)
	{
		cout << a[i] << " ";
	}
	cout << endl;
	system("pause");
	return 0;
}