归并排序

#include <vector>
#include <algorithm>
#include <iterator>
#include <iostream>

void Merge(std::vector<int>& nums, std::vector<int>& res, int left, int mid, int right)
{
	int left1 = left, right1 = mid;
	int left2 = mid + 1, right2 = right;
	int index = left;
	while (left1 <= right1 && left2 <= right2) {
		res[index++] = nums[left1] <= nums[left2] ? nums[left1++] : nums[left2++];
	}
	while (left1 <= right1) res[index++] = nums[left1++];
	while (left2 <= right2) res[index++] = nums[left2++];
	std::copy(res.begin() + left, res.begin() + right + 1, nums.begin() + left);
}

void MergeSort(std::vector<int>& nums, std::vector<int>& res, int left, int right)
{
	if (left < right) {
		int mid = (left + right) >> 1;
		MergeSort(nums, res, left, mid);
		MergeSort(nums, res, mid + 1, right);
		Merge(nums, res, left, mid, right);
	}
}

int main()
{
	std::vector<int> nums{10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, -1};
	std::vector<int> res(nums.size(), 0);
	MergeSort(nums, res, 0, nums.size() - 1);
	std::copy(res.begin(), res.end(), std::ostream_iterator<int>(std::cout, " "));
	std::cout << std::endl;
}