数据结构与算法（归并排序）

归并排序

#include<iostream>
using namespace std;
/*
归并排序：
利用递归函数，将一个数组分为两部分，左边先有序，右边有序
放到同一片内存空间比较，整体有序
*/
class mergesort {

public:

	int process(int* arry, int l, int r) {

		if (l = r)return;
		int mid = l + (r - l) >> 1;
		process(arry, l, mid);//分组
		process(arry, mid + 1, r);//分组

		merge( arry,  l,  mid, r);//排序
	}

	int merge(int* arry, int l, int mid, int r) {
		//开辟新的内存空间
		int* help = new int[r - l + 1];
		int index = 0;
		int p1 = l, p2 = mid + 1;
		while (p1<=mid && p2<=r)
		{
			help[index++] = arry[p1] < arry[p2] ? arry[p1++] : arry[p2++];
		}

		while (p1<=mid)
		{
			help[index++] = arry[p1++];
		}

		while (p2<=r)
		{
			help[index++] = arry[p2++];
		}
		for (int i = 0; i < index; i++)
		{
			arry[l + i] = help[i];
		}


		delete help;

	}

public:
	int arry[100];
};