代码

#include <algorithm>

void sorttwo(unsigned *list, int head, int maxCount)
{
	if (head >= maxCount) return;
	for (int i = head + 1; i < maxCount; ++i)
	{
		if (list[i] < list[head])
		{
			unsigned tmp = list[head];
			list[head] = list[i];
			list[i] = tmp;
		}
	}
	sorttwo(list, head + 1, maxCount);
}

void sort(unsigned *a, int n) 
{
	sorttwo(a, 0, n);
}

评测结果