归并排序的效率是比较高的,设数列长为N,将数列分开成小数列一共要logN步,每步都是一个合并有序数列的过程,时间复杂度可以记为O(N),故一共为O(N*logN)。因为归并排序每次都是在相邻的数据中进行操作,所以归并排序在O(N*logN)的几种排序方法(快速排序,归并排序,希尔排序,堆排序)也是效率比较高的。
原文地址:http://blog.csdn.net/morewindows/article/details/6678165
#include <stdio.h>
#include <stdlib.h>
//将有二个有序数列a[first...mid]和a[mid...last]合并。
void MergeArray(int a[], int first, int mid, int last, int temp[])
{
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); //再将二个有序数列合并
}
}
bool BeginMergeSort(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(void)
{
int a[] = {5,1,4,3,2};
BeginMergeSort(a,5);
for (int i = 0; i < 5; i++)
{
printf("%d ",a[i]);
}
printf("\n");
return 0;
}