基本排序算法——归并排序详解

归并排序的核心就是将待排序元素先不断分割直至不可分割，然后左右合并归一。本质上是分治和递归的使用。话不多说，直接上代码：

#include<iostream>
#include<vector>

using namespace std;

class Solution {
public:
	//明确函数功能：将low至mid和mid+1至high的两段数据归并在一起，开辟新空间
	void merge(vector<int>&a, int low, int mid, int high)
	{
		int* new_arr = new int[high - low + 1];//开辟新空间
		int i = low;        //左指针
		int j = mid + 1;    //右指针
		int k = 0;

		while (i <= mid && j <= high)
		{//公共长度内，依次取小的放入新数组中
			if (a[i] < a[j])
			{
				new_arr[k++] = a[i++];
			}
			else
			{
				new_arr[k++] = a[j++];
			}
		}
		//循环结束表示某一个走完了,剩下的直接放入尾部
		while (i <= mid)
		{
			new_arr[k++] = a[i++];
		}
		while (j <= high)
		{
			new_arr[k++] = a[j++];
		}
		
		//把新数组内容拷贝到原来的数组（注意这里下标与low相关）
		/*int k1 = 0;
		while (low <= high)
		{
			a[low++] = new_arr[k1++];
		}*/
		for (int i = 0; i < high - low + 1; i++)
		{
			a[i + low] = new_arr[i];
		}
		delete[] new_arr;
	}

	//归并排序，对a中的low到high进行归并排序，递归思想
	vector<int> merge_sort(vector<int>& a, int low, int high)
	{
		if (low < high)
		{
			int mid = low + (high - low) / 2;
			merge_sort(a, low, mid);      //对左边归并排序
			merge_sort(a, mid + 1, high); //对右边归并排序
			merge(a, low, mid, high);     //把左右合并在一起
		}
		return a;
	}
};



int main()
{
	Solution p;
	vector<int> arr;
	arr.push_back(5);
	arr.push_back(1);
	arr.push_back(6);
	arr.push_back(3);
	arr.push_back(2);
	arr.push_back(7);
	arr.push_back(4);
	arr.push_back(4);
	arr.push_back(20);
	arr.push_back(31); 
	arr.push_back(15);
	arr.push_back(54);
	cout << "排序前：" << endl;
	for (int i = 0; i < arr.size(); i++)
	{
		cout << arr[i] << " ";
	}
	cout << endl;
	cout << "排序后：" << endl;
	p.merge_sort(arr, 0, 11);
	for (int i = 0; i < arr.size(); i++)
	{
		cout << arr[i] <<" ";
	}
	system("pause");
	return 0;
}