(1)算法思想
(2)二路归并
——文末附代码实现!
手算
代码实现
(3)归并排序(递归)
——文末附代码实现!
(4)算法性能分析
归并排序
#include<bits/stdc++.h>
using namespace std;
int n=7;
int *b=(int *)malloc(n*sizeof(int)); // 辅助数组
//二路归并
void Merge(int a[],int low,int mid,int high){
int i,j,k;
for(i=low;i<=high;i++){
b[i]=a[i];
}
for(i=low,j=mid+1,k=i;i<=mid&&j<=high;k++){
if(b[i]<=b[j]){
a[k]=b[i++];
}else{
a[k]=b[j++];
}
}
while(i<=mid){
a[k++]=b[i++];
}
while(j<=high){
a[k++]=b[j++];
}
}
//归并排序
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(){
int a[]={49,38,65,97,76,13,27};
MergeSort(a,0,n-1);
//输出归并排序后序列
for(int i=0;i<n;i++){
cout<<a[i]<<" ";
}
return 0;
}