//实现一:在Merge合并两个有序子序列过程中new两个临时数组L,R,比较费时
#include<iostream>
using namespace std;
void Merge(int a[], int p, int q, int r)
{
int i, j;
int n1 = q - p + 1, n2 = r - q;
int *L = new int[n1 + 1], *R = new int[n2 + 1];
for (int i = 0; i < n1; i++) L[i] = a[p + i];
for (int i = 0; i < n2; i++) R[i] = a[q + 1 + i];
L[n1] = R[n2] = INT_MAX;
i = j = 0;
for (int k = p; k <= r; k++)
{
if (L[i] <= R[j]) a[k] = L[i++];
else a[k] = R[j++];
}
delete[]L;
delete[]R;
}
void mergeSort(int a[], int p, int r)
{
if (p < r)
{
int q = p + (r - p) / 2;
mergeSort(a, p, q);
mergeSort(a, q + 1, r);
Merge(a, p, q, r);
}
}
int main(void)
{
int a[10] = { 22,13,347,32,24,10,34,7,33,67 };
mergeSort(a, 0, 9);
cout << "After mergeSort:\n";
for (int i = 0; i < 10; i++) cout << a[i] << " ";
return 0;
}
///
//实现二:只在mergeSort过程中new一个临时数组temp,以后的操作都共用这个临时数组
#include<iostream>
using namespace std;
void Merge(int a[], int p, int q, int r, int temp[])
{
int i = p, j = q + 1;
int k = 0;
while (i <= q&&j <= r)
{
if (a[i] <= a[j]) temp[k++] = a[i++];
else temp[k++] = a[j++];
}
while (i <= q) temp[k++] = a[i++]; //把数组a[p]~a[q]中未复制到temp中的元素继续复制到temp中
while (j <= r) temp[k++] = a[j++]; //把数组a[q+1]~a[r]中未复制到temp中的元素继续复制到temp中
for (int i = 0; i < k; i++) a[p + i] = temp[i];
}
void MergeSort(int a[], int p, int r, int temp[])
{
if (p < r)
{
int q = p + (r - p) / 2;
MergeSort(a, p, q, temp);
MergeSort(a, q + 1, r, temp);
Merge(a, p, q, r, temp);
}
}
bool mergeSort(int a[], int p, int r) //返回bool值以便判断临时数组分配是否成功,从而判断排序是否成功
{
int *temp = new int[r - p + 1];
if (temp == nullptr) return false;
MergeSort(a, p, r, temp);
delete[]temp;
return true;
}
int main(void)
{
int a[10] = { 22,13,347,32,24,10,34,7,33,67 };
cout << "After mergeSort:\n";
if (!mergeSort(a, 0, 9)) cout << "Sorting fail!" << endl;
else for (int i = 0; i < 10; i++) cout << a[i] << " ";
return 0;
}
#include<iostream>
using namespace std;
void Merge(int a[], int p, int q, int r)
{
int i, j;
int n1 = q - p + 1, n2 = r - q;
int *L = new int[n1 + 1], *R = new int[n2 + 1];
for (int i = 0; i < n1; i++) L[i] = a[p + i];
for (int i = 0; i < n2; i++) R[i] = a[q + 1 + i];
L[n1] = R[n2] = INT_MAX;
i = j = 0;
for (int k = p; k <= r; k++)
{
if (L[i] <= R[j]) a[k] = L[i++];
else a[k] = R[j++];
}
delete[]L;
delete[]R;
}
void mergeSort(int a[], int p, int r)
{
if (p < r)
{
int q = p + (r - p) / 2;
mergeSort(a, p, q);
mergeSort(a, q + 1, r);
Merge(a, p, q, r);
}
}
int main(void)
{
int a[10] = { 22,13,347,32,24,10,34,7,33,67 };
mergeSort(a, 0, 9);
cout << "After mergeSort:\n";
for (int i = 0; i < 10; i++) cout << a[i] << " ";
return 0;
}
///
//实现二:只在mergeSort过程中new一个临时数组temp,以后的操作都共用这个临时数组
#include<iostream>
using namespace std;
void Merge(int a[], int p, int q, int r, int temp[])
{
int i = p, j = q + 1;
int k = 0;
while (i <= q&&j <= r)
{
if (a[i] <= a[j]) temp[k++] = a[i++];
else temp[k++] = a[j++];
}
while (i <= q) temp[k++] = a[i++]; //把数组a[p]~a[q]中未复制到temp中的元素继续复制到temp中
while (j <= r) temp[k++] = a[j++]; //把数组a[q+1]~a[r]中未复制到temp中的元素继续复制到temp中
for (int i = 0; i < k; i++) a[p + i] = temp[i];
}
void MergeSort(int a[], int p, int r, int temp[])
{
if (p < r)
{
int q = p + (r - p) / 2;
MergeSort(a, p, q, temp);
MergeSort(a, q + 1, r, temp);
Merge(a, p, q, r, temp);
}
}
bool mergeSort(int a[], int p, int r) //返回bool值以便判断临时数组分配是否成功,从而判断排序是否成功
{
int *temp = new int[r - p + 1];
if (temp == nullptr) return false;
MergeSort(a, p, r, temp);
delete[]temp;
return true;
}
int main(void)
{
int a[10] = { 22,13,347,32,24,10,34,7,33,67 };
cout << "After mergeSort:\n";
if (!mergeSort(a, 0, 9)) cout << "Sorting fail!" << endl;
else for (int i = 0; i < 10; i++) cout << a[i] << " ";
return 0;
}