归并排序(没试过)

#include <iostream>
using namespace std;
const int maxn = 1e6+7;

int arr[maxn],  tmp[maxn];

void m_sort(int arr[], int l ,int r)
{
	if (l >= r) return ;
	int mid = l + r >> 1;
	m_sort(arr, l, mid);
	m_sort(arr, mid+1, r);
	int k = 0, i = l, j = mid + 1; 

	while (i <= mid && j <= r)
		if (arr[i] < arr[j]) tmp[k++] = arr[i++];
		else (arr[i] > arr[j]) tmp[k++] = arr[j++];

	while(i <= mid) tmp[k++] = arr[i++];
	while(j <= r) tmp[k++] = arr[j++];

	for (int i = l,j = 0; i <= r; i++, j++) arr[i] = tmp[j];
}

int main()
{
	int n ; cin >> n;
	for (int i = 1; i <= n; i++) cin >> arr[i];
	m_sort(arr, 1, n);
	for (int i = 1; i <= n; i++) cout << arr[i] << " \n"[i==n-1];
}