statistics.cpp

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

#include"illustration.cpp"
void statistics()
{
	int i;
	char ch;
	printf("\t\t\t\tThe Statistic Table\n\n");
	printf("\t\t      bubble   select   insert   shell   quicksort   heapsort\n\n\n");
    printf("  Comparable counter");
	for(i=0;i<6;i++)
	{
		printf("    %d    ",record[i][0]);	
	}
	printf("\n");
	
	printf("  Swaping    counter");
		for(i=0;i<6;i++)
	{
		printf("    %d    ",record[i][1]);
	}
	printf("\n\n");
	printf("Press 'G' to view the illustrtion for more information\n\n");
    ch=getchar();
	if(ch=='g'||ch=='G')
	{
		illustration();
	}
}