代码

void sort(unsigned *a, unsigned n)
{
	unsigned lin[10010];
	for(register int i = 0; i < n; i ++)
	{
		unsigned mi = a[0], ta = 0;
		for(register int j = 1; j < n; j ++)
			if(mi > a[j])
				mi = a[j], ta = j;
		lin[i] = mi, a[ta] = 1000000007;
	}
	for(register int i = 0; i < n; i ++)
		a[i] = lin[i];
}

评测结果