/*
Author:Albert Tesla Wizard
Time:2020/11/24 12:09
*/
#include<bits/stdc++.h>
using namespace std;
void Merge(int a[],int low,int mid,int high)
{
int* b=new int[high-low+1];
int i=low,j=mid+1,k=0;
while(i<=mid&&j<=high)
{
if(a[i]<=a[j])b[k++]=a[i++];
else b[k++]=a[j++];
}
while(i<=mid)b[k++]=a[i++];
while(j<=high)b[k++]=a[j++];
i=low,k=0;
while(i<=high)a[i++]=b[k++];
delete []b;
}
void MergeSort(int a[],int low,int high)
{
if(low<high)
{
int mid=(low+high)/2;
MergeSort(a,low,mid);
MergeSort(a,mid+1,high);
Merge(a,low,mid,high);
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a[10]={1,3,2,5,4,6,7,9,8,10};
MergeSort(a,0,9);
for(int i=0;i<10;i++)cout<<a[i]<<" ";
cout<<'\n';
return 0;
}
数组实现归并排序算法
最新推荐文章于 2022-11-11 19:22:43 发布