【编程任务】
利用非递归的合并排序法实现数据的有序性排列,对数组a(如下所示)进行递增排序。
int a[10]={12,45,-3,78,-29,39,-10,0,25,75}
【实现代码】
#include<iostream>
using namespace std;
void MergeSort(int a[], int n);
void MergePass(int x[], int y[], int s, int n);
void Merge(int c[], int d[], int l, int m, int r);
int main() {
int a[10] = { 12,45,-3,78,-29,39,-10,0,25,75 };
MergeSort(a, 10);
cout << "使用非递归的合并排序法的排序结果为:" << endl;
for (int i = 0; i < 10; i++)
cout << a[i] << '\t';
return 0;
}
void MergeSort(int a[], int n) {
int* b = new int[n];
int s = 1;
while (s < n) {
MergePass(a, b, s, n);
s += s;
MergePass(b, a, s, n);
s += s;
}
delete[] b;
}
void MergePass(int x[], int y[], int s, int n) {
/*合并大小为s的相邻子数组*/
int i = 0;
/*合并大小为s的相邻2段子数组*/
while (i <= n - 2 * s) {
Merge(x, y, i, i + s - 1, i + 2 * s - 1);
i = i + 2 * s;
}
/*剩余元素个数少于2s*/
if (i + s < n)
Merge(x, y, i, i + s - 1, n - 1); /*剩余一组多*/
else
for (int j = i; j <= n - 1; j++) /*剩余小于一组*/
y[j] = x[j];
}
void Merge(int c[], int d[], int l, int m, int r) {
/*合并c[l:m]和c[m+1:r] 到 d[l:r]*/
int i = l, j = m + 1, k = l;
while (i <= m && j <= r) {
if (c[i] <= c[j])
d[k++] = c[i++];
else
d[k++] = c[j++];
}
if (i > m) {
for (int q = j; q <= r; q++)
d[k++] = c[q];
}
else {
for (int q = i; q <= m; q++)
d[k++] = c[q];
}
}