算法分类:
分治
算法原理:
合并排序法是将两个(或两个以上)有序表合并成一个新的有序表,即把待排序序列分为若干个子序列,每个子序列是有序的。然后再把有序子序列合并为整体有序序列。 将已有序的子序列合并,得到完全有序的序列;即先使每个子序列有序,再使子序列段间有序。若将两个有序表合并成一个有序表。
时空复杂度:
时间复杂度O(nlogn)
空间复杂度O(n)
具体实现代码(C):
/*
MergeSort. Code
*/
#include <iostream>
using namespace std;
void merge(int A[], int low, int mid, int high)
{
int len_left = mid - low + 1;
int len_right = high - mid;
int *LEFT = new int[len_left];
int *RIGHT = new int[len_right];
for (int i = 0; i < len_left; ++ i)
LEFT[i] = A[low+i];
for (int i = 0; i < len_right; ++ i)
RIGHT[i] = A[mid+1+i];
int m = 0;
int n = 0;
for (int i = low; i <= high; ++ i)
{
if (m<len_left && n < len_right)
{
A[i] = LEFT[m]<RIGHT[n]?LEFT[m++]:RIGHT[n++];
}
else
{
if (m<len_left)
{
A[i] = LEFT[m++];
}
if (n<len_right)
{
A[i] = RIGHT[n++];
}
}
}
delete [] LEFT;
delete [] RIGHT;
};
void mergesort(int A[], int low, int high)
{
if (low < high)
{
int mid = (low+high) >> 1;
mergesort(A, low, mid);
mergesort(A, mid+1, high);
merge(A, low, mid, high);
}
};
int main()
{
int T,n,a[1005];
cin >> T;
while (T --)
{
cin >> n;
for (int i = 0; i < n; ++ i)
cin >> a[i];
mergesort(a, 0, n-1);
for (int i = 0; i < n-1; ++ i)
cout << a[i] << " ";
cout << a[n-1] << endl;
}
}