代码

template<typename Type>
void sort(Type*const&first,Type*const&last){//[first,last)
	int number=last-first,half=number>>1;
	if(first!=last-1){
Type*	const middleF=first+half,
	*	const temp=new Type[number],
	*	const tlast=temp+number,
	*i=first,*j=middleF,*t=temp;
		sort(first,middleF),sort(middleF,last);
		for(;t!=tlast;)
			*t++= i!=middleF and (j==last or *i<*j)?*i++:*j++;
		for(i=first;i<last;++i)
			*i=temp[i-first];
		delete temp;
	}
}
void sort(unsigned *a, int n) {
	sort(a, a + n);
}

评测结果