分治法解决归并排序问题:
思想:
代码如下:
#include "stdafx.h"
#include<iostream>
#include<iomanip>
using namespace std;
//这个函数是用来最后将两个子问题再来归并排序的
void merge(int r[], int r1[], int head, int mid, int tail)
{
int i = head, j = mid + 1, k = head;
while (i <= mid && j <= tail)
{
if (r[i] <= r[j])
r1[k++] = r[i++];
else
r1[k++] = r[j++];
}
while (i <= mid) //若第一个子序列没处理完,则进行收尾处理
r1[k++] = r[i++];
while (j <= tail) //若第二个子序列没处理完,则进行收尾处理
r1[k++] = r[j++];
}
//归并排序
void mergeSort(int r[], int head, int tail)
{
int mid, r1[1001];
if (head == tail)
return;
else
{
mid = (head + tail) / 2;
mergeSort(r, head, mid); //归并排序前半个子序列
mergeSort(r, mid + 1, tail); //归并排序后半个序列
merge(r, r1, head, mid, tail); //合并两个子序列
for (int i = head; i <= tail; i++) //将有序的序列传回数组r之中
r[i] = r1[i];
}
}
int main()
{
int list[100],n;
cout << "请输入数组的长度N:";
cin >> n;
cout << "请输入数组中的元素值:";
for (int i = 0; i < n; i++)
cin >> list[i];
cout << "进行归并排序……";
mergeSort(list, 0, n-1);
cout << "归并排序后,数组为:"<<endl;
for (int i = 0; i < n; i++)
cout << list[i] << " ";
return 0;
}
程序运行结果:
遇事不决,可问春风。