归并排序
从上到下排序法:
拆分再归并排序:
#include<bits/stdc++.h>
using namespace std;
void SortA(int a[],int low,int mid,int high) //对于每个区间的排序
{
int *tmp;
tmp=(int*)malloc((high-low+1)*sizeof(int));
int i=low,j=mid+1,k=0;
while(i<=mid && j<=high)
{
if(a[i]<a[j])
{
tmp[k++]=a[i++];
}
else
{
tmp[k++]=a[j++];
}
}
while(i<=mid)
{
tmp[k++]=a[i++];
}
while(j<=high)
{
tmp[k++]=a[j++];
}
for(i=0;i<k;i++)
a[low+i]=tmp[i];
free(tmp);
}
void Sort(int a[],int low,int high) //递归,将数组一点点二分,排序
{
if(a==NULL||low>=high) //一般情况应该是low=high吧
return ;
int mid=(low+high)/2;
Sort(a,low,mid);
Sort(a,mid+1,high);
SortA(a,low,mid,high);
}
int main()
{
int n;
cin>>n;
int a[n];
int i;
for(i=0;i<n;i++)
cin>>a[i];
Sort(a,0,n-1);
cout<<a[0];
for(i=1;i<n;i++)
cout<<" "<<a[i];
}