归并排序（总结）

#include<bits/stdc++.h>
using namespace std;
const int N = 100005;
//对于2个有序序列
//a1,a2,...,am
//b1,b2,...,bn 
//t = n + m
//合并后排序, O(tlogt)
// O(t) 
//x^y=z logx(z)=y
//O(nlogn)
int n, a[N];
int tmp[N];

void merge_sort(int l, int r) {
if (l == r) return;
int mid = (l + r) / 2;
merge_sort(l, mid); //归并排序左半段
merge_sort(mid + 1, r); // 右
int al = l, bl = mid + 1;
int len = 0;
while (al <= mid && bl <= r) { // 左区间没走完并且右区间也没走完 
if (a[al] < a[bl]) tmp[++len] = a[al++]; else tmp[++len] = a[bl++]; 
} 
while (al <= mid) tmp[++len] = a[al++]; // 左半段有剩
while (bl <= r) tmp[++len] = a[bl++]; // 有半段有剩
//有序的al,...,amid
//有序的amid+1,...,ar
// 目的:有序的al,...,ar
// al -> tmp1
for (int i = l; i <= r; i++) a[i] = tmp[1 + (i - l)]; 
}

int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
merge_sort(1, n);
for (int i = 1; i <= n; i++) cout << a[i] << " ";
return 0;
}