排序-归并排序(非递归版本)

#include

//合并
void MergePass(int SR[], int TR[], int s, int n)
{
int i = 0;//数组从0开始
int j = 0;

while (i <= n - 2 * s - 1)
{
Merge(SR, TR, i, i + s - 1, i + 2 * s - 1);
i = i + 2 * s;//加上增量
}

if (i < n - s + 1)
{
Merge(SR, TR, i, i + s - 1, n);
}
else
{
for (j = i; j <= n; j++)
{
TR[j] = SR[j];
}
}
}

//非递归归并
void MergerSort_2(int* L, int length)
{
int* TR = (int*)malloc(sizeof(int) * length);
int k = 1;

while (k < length)
{
MergePass(L, TR, k, length);
k = 2 * k;
MergePass(TR, L, k, length);
k = 2 * k;
}
}

void MergerSort(int* L, int length)
{
MergerSort_2(L, length - 1);//数组最后一个元素不存在
}

//main测试
int main(void)
{
int x[10] = { 50, 10, 90, 30, 70, 40, 80, 60, 20, 100 };

MergerSort(x, 10);//sort

system("pause");
return 0;
}