Mergersort的递归及非递归实现

#include <stdio.h>
#include <iostream>
#include <queue>
using namespace std;
 void Merger(int v[],int first,int mid,int last)
{
queue<int> tempV;
int indexA,indexB;
//设置indexA，并扫描subArray1 [first,mid]
           //设置indexB,并扫描subArray2 [mid,last]
indexA=first;
indexB=mid;
while(indexA<mid&&indexB<last)
{
if(v[indexA]<v[indexB])
{
tempV.push(v[indexA]);
indexA++;
}
else
{
tempV.push(v[indexB]);
indexB++;
}
}
//复制没有比较完子表的元素
while(indexA<mid)
{
tempV.push(v[indexA]);
indexA++;
}
while(indexB<last)
{
tempV.push(v[indexB]);
indexB++;
}
int index=0;
while(tempV.size()>0)
{
v[first+index]=tempV.front();
tempV.pop();
index++;
}
 }
 //mergersort递归实现
 void MergerSort(int v[],int first,int last)
 {
if(first+1<last)
{
int mid=(first+last)/2;
MergerSort(v,first,mid);
MergerSort(v,mid,last);
Merger(v,first,mid,last);
}
 }
 //mergersort非递归实现
 void MergerSort2(int v[],int first,int last)
 {
int len=2;//每次循环处理的长度
while(len<last+2)
{
for(int i=0;i<last;i++)
{
Merger(v,i,((i*2+len)/2),i+len-1);
i=i+len;
}
len=len*2;
}
 }
  void main()
{
int v[]={7,10,19,25,12,17,21,30,48};
MergerSort(v,0,8);
// MergerSort2(v,0,8);//传入的不是数组个数
for(int i=0;i<sizeof(v)/sizeof(int);i++)
{
cout<<v[i]<<endl;
}
system("pause");
}