算法_分治策略分析

1、实验报告（ 2016/2017 学年 第二学期）课程名称算法分析与设计实验名称分治策略实验时间2017年3月30日指导单位计算机学院软件工程系指导教师怡婷学生霍淇滨班级学号B15041236学院 (系)计算机学院专业软件工程实 验 报告实验名称分治策略指导教师怡婷实验类型验证型（第 4 个实验密实验学时2实验时间2017-3-30码算法是“设计型” ）一、实验目的和任务理解分治法的算法思想，阅读实现书上已有的部分程序代码并完善程序，加深对分治法的算法原理及实现过程的理解二、实验环境 (实验设备 )Visual Studio 2015三、实验原理及容 （包括操作过程、结果分析等）一、用分治法实现

2、一组无序序列的两路合并排序和快速排序。要求清楚合并排序及快速排序的基本原理，编程实现分别用这两种方法将输入的一组无序序列排序为有序序列后输出。标头 .h#include<iostream>using namespace std;class SortableListpublic:SortableList(int mSize);SortableList();void Input();/输入数组void Output();/输出数组void MergeSort();/两路合并排序void QuickSort();/快速排序private:int *l;/数组指针int maxSize;/

3、数组最大长度int n;/数组已有元素个数void MergeSort(int left, int right);void Merge(int left, int mid, int right);void Swap(int i, int j);/交换函数void QuickSort(int left, int right);int Parition(int left, int right);/分割函数;SortableList:SortableList(int mSize)maxSize = mSize;l = new intmaxSize;n = 0;SortableList:Sortabl

4、eList() deletel;void SortableList:Input()cout << "请输入待排序的数组n"for (int i = 0; i < maxSize; i+)cin >> li;if (li = -1)break;n+;void SortableList:Output()for (int i = 0; i < n; i+)cout << li << " "void SortableList:MergeSort() MergeSort(0, n - 1); void S

5、ortableList:QuickSort() QuickSort(0, n - 1); void SortableList:MergeSort(int left, int right)if (left < right)int mid = (left + right) / 2;MergeSort(left, mid);MergeSort(mid + 1, right);Merge(left, mid, right);void SortableList:Merge(int left, int mid, int right)int *temp = new intright - left +

6、1;int i = left, j = mid + 1, k = 0;while (i <= mid) && (j <= right)if (li <= lj) tempk+ = li+;else tempk+ = lj+;while (i <= mid) tempk+ = li+;while (j <= right) tempk+ = lj+;for (i = 0, k = left; k <= right;)lk+ = tempi+;void SortableList:Swap(int i, int j)int c = li;li = l

7、j;lj = c;void SortableList:QuickSort(int left, int right)if (left < right)int j = Parition(left, right);QuickSort(left, j - 1);QuickSort(j + 1, right);int SortableList:Parition(int left, int right)int i = left, j = right + 1;dodo i+; while (li < lleft);do j-; while (lj > lleft);if (i < j

8、) Swap(i, j); while (i < j); Swap(left, j); return j;源 .app#include<iostream>#include"标头 .h"using namespace std;void main()int n = 10;SortableList my1(n);SortableList my2(n);my1.Input();my2.Input();my1.MergeSort();my2.QuickSort();my1.Output();my2.Output();二、采用基于“五元中值组取中值分割法”（ medi

9、an-of-median-of-fivepartitioning ）的线性时间选择算法，找出N 个元素集合S 中的第k 个最小的元素，使其在线性时间解决。标头 .h#include<iostream>using namespace std;enum ResultCode OutOfBounds,Success;class SortableListpublic:SortableList(int mSize);SortableList();void Input();void Output();ResultCode Select(int &x, int k);private:in

10、t *l;int maxSize;int n;void Swap(int i, int j);void InsertSort(int left, int right);int Partition(int left, int right);int Select(int k,int left,int right,int r);SortableList:SortableList(int mSize)maxSize = mSize;l = new intmaxSize;n = 0;SortableList:SortableList() deletel;void SortableList:Input()

11、cout << "请输入带排序的数组n"for (int i = 0; i < maxSize; i+)cin >> li;if (li = -1)break;n+;void SortableList:Output()for (int i = 0; i < n; i+)cout << li << " "void SortableList:Swap(int i, int j)int c = li;li = lj;lj = c;int SortableList:Partition(int left,

12、 int right)int i = left, j = right + 1;dodo i+; while (li < lleft);do j-; while (lj > lleft);if (i < j) Swap(i, j); while (i < j);Swap(left, j);return j;ResultCode SortableList:Select(int &x, int k)if (n <= 0 | k > n | k <= 0)return OutOfBounds;int j = Select(k, 0,n - 1, 5);

13、x = lj;return Success;int SortableList:Select(int k, int left, int right, int r)int n = right - left + 1;if (n <= r) /若问题足够小，使用直接插入排序InsertSort(left, right);return left + k - 1; /取其中的第 k小元素，其下标为 left+k-1for (int i = 1; i <= n / r; i+)InsertSort(left + (i - 1)*r, left + i*r - 1); /二次取中规则求每组的中间值

14、Swap(left + i - 1, left + (i - 1)*r + (int)ceil(double)r / 2) - 1); /将每组的中间值交换到子表前部集中存放/ 求二次中间值，其下标为jint j = Select(int)ceil(double)n / r / 2), left, left + (n / r) - 1, r);Swap(left, j); /二次中间值为枢纽元，并换至left处j = Partition(left, right); /对表（子表）进行分划操作if (k = j - left + 1)return j; /返回第 k小元素下标else if (k

15、<j - left + 1)return Select(k, left, j - 1, r);/在左子表求第 k小元素else return Select(k - (j - left + 1), j + 1, right, r); /在右子表求第k-(j-left+1)小元素void SortableList:InsertSort(int left, int right)for (int i = left+1; i <= right; i+)int j = i;int temp = li;while (j > left && temp < lj - 1)lj = lj - 1; j-