归并排序(模板) in C++

const int MAXN = 1e6 + 10;
int tmp[MAXN];
void merge_sort(int a[], int l, int r) {
	if (l < r) {
		int mid = l + r >> 1;
		merge_sort(a, l, mid);
		merge_sort(a, mid + 1, r);

		int k = 0, i = l, j = mid + 1;
		while (i <= mid && j <= r) {
			if (a[i] <= a[j]) tmp[k++] = a[i++];
			else tmp[k++] = a[j++];
		}
		while (i <= mid)tmp[k++] = a[i++];
		while (j <= r)tmp[k++] = a[j++];

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

使用VS时，tmp数组开的太大会造成栈溢出，将堆栈保留大小调大即可。