C++归并排序

递归方式，包含3个函数：
merge_sort 归并排序
merge 融合有序数组
show_arr显示数组

#include<iostream>
#include <typeinfo>
#include <string>
using namespace std;

#define len(a) sizeof(a)/sizeof(a[0])

//融合有序数组
void merge(int* arr, int left, int mid, int right)
{
	int i = left; //左数组起点
	int j = mid+1;//右数组起点
	int m = 0;
	const int left_ = left;
	const int right_ = right;
	int len_tmp = right - left + 1;
	int *tmp = new int[len_tmp]; //创建临时数组，存放有序数列

	while (i <= mid && j <= right)
	{
		//把小的放进去
		if (arr[i] < arr[j])
		{
			tmp[m] = arr[i];
			i++;
			m++;
		}
		else
		{
			tmp[m] = arr[j];
			j++;
			m++;
		}
	}
	//有剩下的数字全部加进去
	while (i <= mid)
	{
		tmp[m] = arr[i];
		i++;
		m++;
	}
	while (j <= right)
	{
		tmp[m] = arr[j];
		j++;
		m++;
	}
	cout << "after merge:";
	for (int i = 0; i != len_tmp; i++)
	{
		cout << tmp[i] << " ";
		arr[i] = tmp[i]; //将排序后的值赋给原数组
		
	}
	cout << endl;
}

//归并排序
void merge_sort(int* arr, int left, int right)
{

	//只有一个数，不操作
	if (right - left == 0)
	{
		return;
	}
	//有2个数，判断大小是否有小到大，不是就替换
	if (right - left == 1)
	{
		int t;

		if (arr[left] < arr[right])
		{
			return;
		}
		else
		{
			t = arr[right];
			arr[right] = arr[left];
			arr[left] = t;
		}
		return;
	}
	if (left < right)
	{
		int mid = (left + right) / 2;
		//左边归并
		merge_sort(&arr[left], left, mid);
		//右边归并
		merge_sort(&arr[mid + 1], 0, right-mid-1);
		merge(&arr[left], left, mid, right);
	}
}

//显示数组
void show_arr(int* arr, int len)
{
	for (int i = 0; i != len; i++)
	{
		cout << arr[i] << " ";
	}
	cout << endl;
}

void main()
{
	int arr[] = { 2, 23, 32, -2, 45, 6, 5, 20, 7, 6, 87, 15 };
	//显示原数组
	show_arr(arr, len(arr));

	//归并排序
	merge_sort(arr, 0, len(arr)-1);
	show_arr(arr, len(arr));
	cout << endl;
}