2-路排序问题(递归实现)
const int maxn=100;
void merge(int A[],int L1,int R1,int L2,int R2){
int i=L1,j=L2;
int temp[maxn],index=0;
while(i<=R1&&j<=R2){
if(A[i]<=A[j]){
temp[index++]=A[i++];
}else{
temp[index++]=A[j++];
}
}
while(i<=R1) temp[index++]=A[i++];
while(j<=R2) temp[index++]=A[j++];
for(i=0;i<index;i++){
A[L1+i]=temp[i];
}
}
void mergesort(int A[],int left,int right){
if(left<right){
int mid=(left+right)/2;
mergesort(A,left,mid);
mergesort(A,mid+1,right);
merge(A,left,mid,mid+1,right);
}
}
#include<iostream>
using namespace std;
int main(){
int A[16]={2,1,3,6,4,5,9,8,7,15,12,18,10,21,65,88};
mergesort(A,0,15);
for(int i=0;i<16;i++){
printf("%d\t",A[i]);
}
return 0;
}
输出结果:1 2 3 4 5 6 7 8 9 10 12 15 18 21 65 88