select.cpp

排序算法的内部复杂度分析,有八个算法,有时间和空间的分析,比较完整

void select(int items[],int count)
{
	register int a,b,c;
	int exchange;
	int t;
	for (a=0;a<count-1;a++)
	{
		exchange=0;
		c=a;
		t=items[a];
		for(b=a+1;b<count;b++)
		{
			if(items[b]<t)
			{
				c=b;
				t=items[b];
				exchange=1;	selectrecord=1;
			recordin();
			}
		}
		if(exchange)
		{
			items[c]=items[a];
			items[a]=t;
		
		}
	}
}