recordin.cpp

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

void recordin()
{
	if(bubblerecord)
	{
	  record[0][0]=record[0][0]+1;
	  record[0][1]=record[0][1]+3;
	  bubblerecord=0;
	}

    if(selectrecord)
	{
	  record[1][0]=record[1][0]+1;
	  record[1][1]=record[1][1]+3;
	  selectrecord=0;
	}

    if(insertrecord)
	{
	  record[2][0]=record[2][0]+1;
	  record[2][1]=record[2][1]+3;
	  insertrecord=0;
	}
	if(shellrecord)
	{
	  record[3][0]=record[3][0]+1;
	  record[3][1]=record[3][1]+3;
	  shellrecord=0;
	}
	if(quicksortrecord)
	{
	  record[4][0]=record[4][0]+1;
	  record[4][1]=record[4][1]+3;
	  quicksortrecord=0;
	}

	if(heapsortrecord)
	{
		record[5][0]=record[5][0]+1;
		record[5][1]=record[5][1]+3;
		heapsortrecord=0;
	}
}