代码

void merge(unsigned *a, int *lin, int l, int r)
{
	if(l == r)
		return;
	int t = l, t1 = l, mid = (l + r) >> 1, t2 = mid + 1;
	merge(a, lin, l, mid), merge(a, lin, mid + 1, r);
	while(t1 <= mid && t2 <= r)
		lin[t ++] = (a[t1] < a[t2]) ? a[t1 ++] : a[t2 ++];
	while(t1 <= mid)
		lin[t ++] = a[t1 ++];
	while(t2 <= r)
		lin[t ++] = a[t2 ++];
	for(register int i = l; i <= r; i ++)
		a[i] = lin[i];
}

void sort(unsigned *a, int n)
{
        int lin[100000010];
	merge(a, lin, 0, n - 1);
}

评测结果