一、归并排序的思想
归并排序利用了分冶的思想,将一块待排序的区间,取中间位置,分成两段区间;然后通过不断的递归,直到每段区间只有一个数字,这时我们就认为该段区间有序,然后将这相邻的两段有序区间合并为一个有序区间;
这样通过递归先分裂数组,然后再合并数组,就完成了归并排序;
二,实例代码
//归并排序
void _MergeSort(int* a,int left,int right,int* tmp)
{
if(left >= right)
return ;
int mid = left + ((right - left)>>1);//DUIZHEJUHUAYOULEXINDELIJIE
_MergeSort(a,left,mid,tmp);
_MergeSort(a,mid+1,right,tmp);
int Begin1 = left,End1 = mid;
int Begin2 = mid+1,End2 = right;
size_t index = left;
while(Begin1 <= End1 && Begin2 <= End2)
{
if(a[Begin1] < a[Begin2])
tmp[index++] = a[Begin1++];
else
tmp[index++] = a[Begin2++];
}
while(Begin1 <= End1)
tmp[index++] = a[Begin1++];
while(Begin2 <= End2)
tmp[index++] = a[Begin2++];
for(int i = 0; i < index ;++i)//这里是查看归并的过程,并无别的作用
printf("%d ",tmp[i]);
printf("\n");
memcpy(a+left,tmp+left,sizeof(int)*(right-left+1));
}
void MergeSort(int* a,size_t n)
{
int* tmp = new int[n];
_MergeSort(a,0,n-1,tmp);
delete[] tmp;
}
void Mergetest()
{
int a[] = {2,5,4,9,3,6,8,7,1,0};
int a1[] = {9,8,5,3,2,4,0,7,6,11,10};
MergeSort(a,(sizeof(a)/sizeof(a[0])));//动态内存管理的问题
Print(a,sizeof(a)/sizeof(a[0]));
}