归并排序的循环实现

归并排序的循环实现的原理和递归是一样的，只是把递归改成了循环。
详情可戳：递归排序的递归实现
代码如下：

#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 110;
int n,one,A[maxn];
void merges(int A[],int L1,int R1,int L2,int R2){
    int i = L1,j = L2,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(){
    for(int step = 2;step / 2 <= n; step *= 2){
        for(int i = 1;i <= n;i += step){
            int mid = i + step / 2 - 1;
            if(mid + 1 <= n){
                merges(A,i,mid,mid+1,min(i+step-1,n));
            }
        }
    }
}
int main(){
    cin >> n;
    for(int i = 1;i <= n;i ++){cin >> A[i];}
    mergesort();
    for(int i = 1;i <= n;i ++)   cout << A[i] << " ";
    return 0;
}
/*
sample input:
5
2 3 5 1 4
sample output:
1 2 3 4 5
*/