数据结构 归并排序（非递归算法）

 #include<stdio.h>
 
 void Merge(int  SR[],int  TR[],int i,int m,int n)
 { 
   int j,k,l;
   for(j=m+1,k=i;i<=m&&j<=n;++k) // 将SR中记录由小到大地并入TR
     if (SR[i]<=SR[j])
       TR[k]=SR[i++];
     else
       TR[k]=SR[j++];
   if(i<=m)
     for(l=0;l<=m-i;l++)
       TR[k+l]=SR[i+l]; // 将剩余的SR[i..m]复制到TR
   if(j<=n)
     for(l=0;l<=n-j;l++)
       TR[k+l]=SR[j+l]; // 将剩余的SR[j..n]复制到TR

 }
void print(int L[],int n)
 {
   int i;
   for(i=1;i<=n;i++)
     printf("%d ",L[i]);
 
 }

 void MSort(int S[],int  L[],int length)
 {   int i,j,m,k;
     for(i=1;i<=length;i++)