#include
<iostream>
//合并
void Merge(int a[],int p, int q, int
r)
{
//定义两个,记录连个子序列的个数,
int m,n;
m = q - p + 1;
n = r - q;
//定义两个数组用来存放a中的两个子序列
int *Left = new int[m];
int *Right = new int[n];
//将a中的两个子序列进行复制
int i,j,k;
for(i = 0, j = p; i <
m; i++)
{
Left[i] = a[j++];
}
for(i = 0, j = (q + 1); i
< n; i++)
{
Right[i] = a[j++];
}
//将元素复制回a数组
i = j = 0;
for(k = p; k < r;
k++)
{
if(Left[i] <
Right[j])
{
a[k] = Left[i++];
if(i == m)
{
while(j != n)
{
a[++k] = Right[j++];
}
}
}
else
{
a[k] = Right[j++];
if(j == n)
{
while(i != m)
{
a[++k] = Left[i++];
}
}
}
}
}
//排序的递归函数
//分解,解决,合并
void Sort(int a[],int p, int
r)
{
if(p < r)
{
int q = (r + p)/2;
Sort(a,p,q);
Sort(a,q + 1,r);
Merge(a, p, q, r);
}
}
int main()
{
int a[15] =
{23,599,55,16,99,26,95,89,13,32,78,9,544,223,5};
Sort(a,0,14);
for(int i = 0; i <=
14; i++)
{
std::cout<<a[i]<<"
";
}
getchar();
}