版权声明:关中大侠Lv轻侯 https://blog.csdn.net/weixin_44312186/article/details/88558135
递归写法:
#include<bits/stdc++.h>
#define maxn 100
void merge(int A[],int l1,int r1,int l2,int r2) //将数组A的区间[l1,R1]和区间[l2,R2]合并为一个有序区间
{
int temp[maxn],index=0;
int i=l1,j=l2;
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(int i=0;i<index;i++){
A[l1+i]=temp[i];
}
}
void mergesort(int A[],int left,int right){//将数组A排序
if(left<right){
int mid=(left+right)/2;
mergesort(A,left,mid);
mergesort(A,mid+1,right);
merge(A,left,mid,mid+1,right);
}
}
int main()
{
int A[]={66,12,33,57,64,27,18};
for(int i=0;i<7;i++){
printf("%d ",A[i]);
}
printf("\n");
mergesort(A,0,6);
for(int i=0;i<7;i++){
printf("%d ",A[i]);
}
return 0;
}
非递归写法: