#include <iostream>
using namespace std;
//合并数组
void MergeArray(int *unsorted,int *sorted,int first,int mid,int last)
{
int i=first,j=mid+1,k=0;
while(i<=mid && j<=last) //先循环两个区间都没有结束的情况
{
if(unsorted[i]<unsorted[j])
sorted[k++]=unsorted[i++];
else
sorted[k++]=unsorted[j++];
}
//转存剩余元素
while(i<=mid)
sorted[k++]=unsorted[i++];
while(j<=last)
sorted[k++]=unsorted[j++];
//将sorted数组元素还回给unsorted数组
for(i=0;i<k;i++)
unsorted[first+i]=sorted[i];
}
//递归序列
void Recursion(int *unsorted,int *sorted,int first,int last)
{
if(first<last)
{
int mid=(first+last)/2; //取分割位置
Recursion(unsorted,sorted,first,mid); //递归划分数组左序列
Recursion(unsorted,sorted,mid+1,last); //递归划分数组右序列
MergeArray(unsorted,sorted,first,mid,last); //数组合并
}
}
bool merge_sort(int *arr,int len)
{
int *pArr=new int[len];
if(NULL==pArr)
return false;
Recursion(arr,pArr,0,len-1);
delete[] pArr;
return true;
}
int main()
{
int array[]={36,115,24,63,42,21,5,11},i;
int size=sizeof(array)/sizeof(array[0]);
cout<<"排序前:";
for(i=0;i<size;i++)
cout<<array[i]<<" ";
cout<<endl;
merge_sort(array,size);
cout<<"排序后:";
for(i=0;i<size;i++)
cout<<array[i]<<" ";
cout<<endl;
return 0;
}