recordout.cpp

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

void recordout()
{
	if(bubblerecord)
	
	{   printf("\n");
		printf("comparable counter is:%d\t\n",record[0][0]);
		printf("\n");
		printf("the swaping counter is:%d\t\n",record[0][1]);
	bubblerecord=0;
	}
	if(selectrecord)
	
	{   printf("\n");
		printf("comparable counter is:\t%d\t\n",record[1][0]);
		printf("\n");
		printf("the swaping counter is:\t%d\t\n",record[1][1]);
	selectrecord=0;
	}
	if(insertrecord)
	
	{   printf("\n");
		printf("comparable counter is:\t%d\t\n",record[2][0]);
		printf("\n");
		printf("the swaping counter is:\t%d\t\n",record[2][1]);
	insertrecord=0;
	}
	if(shellrecord)	
	{   printf("\n");
		printf("comparable counter is:\t%d\t\n",record[3][0]);
		printf("\n");
		printf("the swaping counter is:\t%d\t\n",record[3][1]);
	shellrecord=0;
	}
	
     if(quicksortrecord)
	{   printf("\n");
		printf("comparable counter is:\t%d\t\n",record[4][0]);
		printf("\n");
		printf("the swaping counter is:\t%d\t\n",record[4][1]);
	quicksortrecord=0;
	}
    if(heapsortrecord)
	{   printf("\n");
		printf("comparable counter is:\t%d\t\n",record[5][0]);
		printf("\n");
		printf("the swaping counter is:\t%d\t\n",record[5][1]);
    heapsortrecord=0;
	}
}