开始学习算法导论

将书中算法用C++还原一遍，慢慢学习

首先是Merge-sort算法，使用模版

#include<iostream>
template<typename T>
void MergeSort(T *arr, int p, int r);
template<typename T>
void Merge(T *arr, int p, int q, int r);
int main()
{
	using namespace std;
	int ap[10]{9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
	for (int i = 0; i < 10; i++)
		cout << ap[i] << " ";
	cout << "\n";
	MergeSort(ap, 0, 9);
	for (int i = 0; i < 10; i++)
		cout << ap[i] << " ";
	cout << "\n";

	double bp[10]{9.6, 10.3, 7.0, 6.2, 5.33, 4.1, 3.13, 2.2, -1.9, 0.9};
	for (int i = 0; i < 10; i++)
		cout << bp[i] << " ";
	cout << "\n";
	MergeSort(bp, 0, 9);
	for (int i = 0; i < 10; i++)
		cout << bp[i] << " ";
	cout << "\n";

	return 0;
}

template<typename T>
void MergeSort(T *arr, int p, int r)
{
	int q;
	if (p < r)
	{
		q = (p + r) / 2;
		MergeSort(arr, p, q);
		MergeSort(arr, q + 1, r);
		Merge(arr, p, q, r);
	}
}

template<typename T>
void Merge(T *arr, int p, int q, int r)
{
	T *arr1 = new T[q - p + 1];
	T *arr2 = new T[r - q];
	for (int i = p; i <= q; i++)
		arr1[i - p] = arr[i];
	for (int j = q + 1; j <= r; j++)
		arr2[j - q - 1] = arr[j];
	for (int k = p, i = p, j = q + 1; k <= r; k++)
	{
		if (i > q)
		{
			arr[k] = arr2[j - q - 1];
			j++;
			continue;
		}
		if (j > r)
		{
			arr[k] = arr1[i - p];
			i++;
			continue;
		}
		if (arr1[i - p] < arr2[j - q - 1])
		{
			arr[k] = arr1[i - p];
			i++;
		}
		else
		{
			arr[k] = arr2[j - q - 1];
			j++;
		}
	}
}