归并排序非递归

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<queue>
#include<cmath>
#include<set>
#include<vector>
using namespace std;
int n;
void merg(int a[],int left,int mid,int right)//传入l,mid,r;
{
    int i=left;
    int j=mid+1;
    int temp[1000];
    int k=0;
    while(i<=mid&&j<=right)
    {
        if(a[i]<a[j])temp[k++]=a[i++];
        if(a[i]>a[j])temp[k++]=a[j++];
    }
    while(i<=mid)temp[k++]=a[i++];
    while(j<=right)temp[k++]=a[j++];
    int cn1,cn2;
    for(cn1=left,cn2=0;cn2<k;cn1++,cn2++)
        a[cn1]=temp[cn2];
    return ;
}
void mergeSort(int a[],int len)//传入数组长度
{
    int sz=1;
    while(sz<=len-1)//每次将a[]划分为大小为2*sz若干段；每段为[left,left+2*sz-1]；
    {
        //cout<<sz<<"sz"<<endl;
        int left=0;
        while(left+sz-1<=len-1)
        {
            int mid=left+sz-1;
            int right=left+2*sz-1;
            if(right>len-1)
                right=len-1;
            merg(a,left,mid,right);
            //cout<<left<<" "<<mid<<" "<<right<<endl;
            for(int i=0;i<n;i++)cout<<a[i]<<" ";
            //cout<<endl;
            left=right+1;//对下一段进行归并排序
        }
        sz=sz*2;//将size扩大；
    }
    return ;
}
int main()
{
   n=4;
   int a[]={100,1,4,2};
   //int a[] = {2,5,1,-3,7,9,18,4,6};
   mergeSort(a,n);
   for(int i=0;i<n;i++)cout<<a[i]<<" ";
   return 0;
}