归并排序(Merge sort,台湾译作:合并排序)是建立在归并操作上的一种有效的排序算法。该算法是采用分治法(Divide and Conquer)的一个非常典型的应用。(维基百科)
参考文章:
http://blog.csdn.net/morewindows/article/details/6678165
下面是具体代码:
#include <stdio.h>
#define true 1
#define false 0
//将有二个有序数列a[first...mid]和a[mid...last]合并。
void mergearray(int a[], int first, int mid, int last, int temp[])//first,mid,last均为下标
{
int i = first, j = mid + 1;
int m = mid, 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); //再将二个有序数列合并
}
}
int MergeSort(int a[], int n)
{
//int *p = new int[n];
int * p = (int *)malloc( n*sizeof(int) );
if (p == NULL)
return false;
mergesort(a, 0, n - 1, p);
//delete[] p;
free(p);
return true;
}
int main()
{
int i;
int a[]={23,4,9,34,12,3,89,7,80};
MergeSort(a,9);
for(i=0; i<9; i++)
printf("%d ",a[i]);
printf("\n");
return 0;
}