#include<iostream>
using namespace std;
void copy(int b[],int a[],int left,int right){
for(int i=left;i<=right;i++) a[i]=b[i];
}
void merge(int a[],int b[],int left,int mid,int right){
int i=left,j=mid+1,k=left;
while(i<=mid&&j<=right){ //比较两个值,小的先放;
if(a[i]<a[j])
b[k]=a[i],k++,i++;
else
b[k]=a[j],k++,j++;
}
while(i<=mid){ //可能右边存完,左边有剩的;
b[k]=a[i],k++,i++;
}
while(j<=right){ //或右完左剩;
b[k]=a[j],k++,j++;
}
}
void mergeSort(int a[],int left,int right){
int b[10];
if(left>=right) return;//打底;
int mid=(left+right)/2;
mergeSort(a,left,mid);//左有序;
mergeSort(a,mid+1,right);//右有序;
merge(a,b,left,mid,right);//合并到b数组;
copy(b,a,left,right);//拷贝回a数组;
}
int main(){
int a[10]{1,3,4,6,2,7,9,8,5,10};
mergeSort(a,0,9);
for(int i=0;i<=9;i++) cout<<a[i]<<" ";
return 0;
}
归并排序模板
最新推荐文章于 2024-08-06 19:36:58 发布