(4)归并排序
给定一个整数数组,要求从小到大的顺序排列,归并排序的思想就是将待排序元素分成大小大致相同的2个子集合,分别对2个子集合进行排序,最终将排好序的子集合合并成为所要求的排好序的集合。
例如对数组R[8] = {R[8] = {18, 2, 20, 34, 12, 32, 6, 16}排序
(1)先将数组分成两个子集R1={18, 2, 20, 34},R2={12, 32, 6, 16},
(2)将R1和R2继续分小,如R1可分为R3={18,2},R4={20,34},最后分成{18}、{2}、{20}、{34}这样由一个元素组成的集合,R2也依此划分
(3){18}、{2}可以按大小排序变成{2,18},{20}、{34}按大小排序变成{20,34}
(4)A={2,18}、B={20,34},A、B都从第一个数开始比较
a. i=0,j=0,A[i]<B[j],取出A[0],i++
b. A[i]<B[j],取出A[1],i++
c. B中剩下的数依次都取出
排序后集合的顺序为{2,18,20,34}
(5)R2中的排序为{6,12,16,32},再按(4)中的方法合并两个数组为{2 6 12 16 18 20 32 34}
排序过程如下
完整代码:
#include <cstdlib>
#include <iostream>
using namespace std;
void Merg(int R[], int low, int mid, int high)
{
int *t = new int[high-low+1];
int i=low,j=mid+1,k=0;
while(i <= mid && j <= high){
if(R[i] < R[j]){
t[k++] = R[i++];
}else{
t[k++] = R[j++];
}
}
while(i <= mid){
t[k++] = R[i++];
}
while(j <= high){
t[k++] = R[j++];
}
for(k = 0, i = low; i <= high ; i++, k++){
R[i] = t[k];
}
delete[] t;
}
void MergSortDc(int R[], int low, int high)
{
int mid;
if(low < high){
mid = (low+high)/2;
MergSortDc(R, low, mid);
MergSortDc(R, low+1, high);
Merg(R, low, mid, high);
}
}
void MergSort(int R[], int n)
{
MergSortDc(R, 0, n-1);
}
int main()
{
int R[8] = {18, 2, 20, 34, 12, 32, 6, 16};
int n = 8;
MergSort(R, n);
for(int i = 0; i < n; i++){
cout<<R[i]<<" ";
}
cout<<endl;
system("PAUSE");
return 0;
}
运行结果: