大家看下这归并排序代码有什么问题
好久没弄算法了 写个归并排序就出问题
#include <iostream>
using std::cout;
using std::endl;
void meg(int *src, int* tmp, int fr, int la, int to)
{
int k=0;
int flag = la;
while (fr<flag && la<=to)
{
if (src[fr] >= src[la])
{
tmp[k] = src[la];
la++;
}
else
{
tmp[k] = src[fr];
fr++;
}
k++;
}
while (fr<flag)
{
tmp[k] = src[fr];
fr++;
k++;
}
while (la<=to)
{
tmp[k] = src[la];
la++;
k++;
}
}
void megSort(int *src, int *tmp, int s, int en)
{
int mid = (s+en)/2;
if (s == en)
{
tmp[s] = src[s];
}
else
{
int* buf = new int[en+1];
megSort(src, buf, s, mid);
megSort(src, buf, mid+1, en);
meg(buf, src, s, mid+1, en);
delete []buf;
}
}
int main()
{
int src[5] = {55,22,100,85,96};
int temp[5];
megSort(src, temp, 0, 4);
cout<<"\n****************************************************"<<endl;
for (int i=0; i<5; i++)
{
cout<<src[i]<<" ";
}
return 0;
}
调这段代码伤啊，楼主看下书上的例子吧，五楼正解，你代码运行结果为
