#include<iostream>
using namespace std;
int is1[]={1,3,5,7,9,0,2,4,6,8},is2[10];
void merge(int low,int mid,int high) ;
void mergeSort(int a,int b)
{
if (a<b)
{
int mid=(a+b)/2;
mergeSort(a,mid);
mergeSort(mid+1,b);
merge(a,mid,b);
}
}
void merge(int low,int mid,int high)
{
int i=low,j=mid+1,k=low;
while (i<=mid&&j<=high)
if (is1[i]<=is1[j]) // 此处为排序顺序的关键,用小于表示从小到大排序
is2[k++]=is1[i++];
else
is2[k++]=is1[j++];
while (i<=mid)
is2[k++]=is1[i++];
while (j<=high)
is2[k++]=is1[j++];
for (i=low;i<=high;i++)// 写回原数组
is1[i]=is2[i];
}
void printint(int arr[],int len)
{
for (int i=0;i<10;i++)
{
cout<<arr[i]<<" ";
}
}
void main()
{
mergeSort(0,9);
printint(is1,10);
}
<script type="text/javascript" id="wumiiRelatedItems"> </script>