归并排序之CC++程序

//MergeSort.h
#pragma once
void MergeArray(int a[], int first, int mid, int last, int temp[]);
void MergeSortRecursion(int a[], int first, int last, int temp[]);

bool MergeSort(int a[], int n);

//MergeSort.cpp
#include <stdio.h>
#include "MergeSort.h"
// 1.first == last是递归出口，不会再进去子递归，此时返回
// 2.是递归函数会记住现场，返回时进行计算，得到值
void MergeArray(int a[], int first, int mid, int last, int temp[])
{
int i = first;
int j = mid + 1;
int k = 0;
// (1).注意<=
while( i <= mid && j<= last)
{
if(a[i] <= a[j])
{
temp[k++] = a[i++];
}
else
{
temp[k++] = a[j++];
}
}

while(i <= mid)
{
temp[k++] = a[i++];
}

while(j <= last)
{
temp[k++] = a[j++];
}

// (2)注意[0,k]拷贝到[first + 0, first + k]
for(int i = 0; i < k/*last*/; i++)
{
a[first + i] = temp[i];
}
};


void MergeSortRecursion(int a[], int first, int last, int temp[])
{
if(first < last)
{
int mid = (first + last) / 2;
MergeSortRecursion(a, first, mid, temp);
MergeSortRecursion(a, mid + 1, last, temp);
MergeArray(a, first, mid, last, temp);
}
else
{
return;
}
};

bool MergeSort(int a[], int n)
{
int *temp = new int[n];
MergeSortRecursion(a,0, n - 1, temp);
delete []temp;
return true;
}

void main()
{
int n[5] = {2,3,1,5,4};
MergeSort(n, 5);
for(int i = 0; i < 5; i++)
{
printf("MergeSort Value:%d\n",  n[i]);
}
while(1);
}

参考自文章：http://blog.csdn.net/morewindows/article/details/6678165