归并排序无递归

#include <iostream>

using namespace std;

void MergeSort(int *a,int n);
void MergePass(int *a, int s,int n);
void Merge(int *a, int left, int mid, int right);
void output(int *a, int n);

int main()
{
    int n;
    int *a;
    cin >> n;
    a = (int *)malloc(n * sizeof(int));
    for (int i = 0; i < n;i++)
    {
        cin >> a[i];
    }
   
    MergeSort(a,n);
    output(a,n);
    return 0;
}

void MergeSort(int *a,int n)
{

    int s = 1;
    while(s<n)
    {
        MergePass(a,s,n);
        s += s;
    }
}

void MergePass(int *a,int s,int n)
{
    int i = 0;
    while(i<=n-2*s)
    {
        Merge(a, i, i + s - 1, i + 2 * s - 1);
        i = i + 2*s;
    }

    if((i+s)<n)
    {
        Merge(a, i, i + s - 1, n - 1);
    }
    
}

void Merge(int *a,int left,int mid,int right)
{
    int i = left;
    int j = mid+1;
    int k = 0;
    int *b = (int *)malloc((right - left + 1) * sizeof(int));
    while(i<=mid&&j<=right)
    {
        if(a[i]<=a[j])
        {
            b[k++] = a[i++];
        }
        
        else
        {
            b[k++] = a[j++];
        }
        
    }

    while(i<=mid)
    {
        b[k++] = a[i++];
    }

    while(j<=right)
    {
        b[k++] = a[j++];
    }

    for (i = left, k = 0; i <= right; i++,k++)
    {
        a[i] = b[k];
    }
}

void output(int *a,int n)
{
    for (int i = 0; i < n;i++)
    {
        cout << a[i] << endl;
    }
}