use_d.cpp

比较各种排序的算法间的运行效率 自己写的不太完善

void Use_D(double &time_d, int &contrastNum, int &moveNum)
{
     int i, array[NUM];
     ifstream inFile;
	 ofstream outFile;
	 //int contrastNum, moveNum;
	 clock_t start, finish;
	 //double time_d;
     
     //从文件中把数据复制到数组array中------------------------------------------
     inFile.open("before.txt");
	 if(!inFile)
	 {
	 	cout<<"before.txt can't open."<<endl;
	  	abort();
     }
	 for(i=0;i<NUM;i++)
       inFile>>array[i];
     inFile.close();
     //复制完成-----------------------------------------------------------------
     
     //利用选择排序法排序并且对其计时了----------------------------------------- 
	 contrastNum = 0;
	 moveNum = 0;
     start = clock();
	 heapsort(array,NUM,contrastNum,moveNum);
	 finish = clock();

	 time_d = double(finish-start);
	 //cout<<"堆排序完成！"<<endl<<"堆排序使用时间为: "<<time_d<<" × 1/CLOCK_PER_SEC 秒"<<endl;
	 //cout<<"比较次数为"<<contrastNum<<"; 移动次数为"<<moveNum<<endl;
	 //cout<<"  堆排序"<<setw(9)<<time_d<<setw(9)<<contrastNum<<setw(9)<<moveNum<<endl;
	 
	 //将排序排好的结果保存在文件中--------------------------------------------- 
	 outFile.open("d_result.txt");
	 if(!outFile)
	 {
		         cout<<"d_result.txt can't open."<<endl;
		         abort();
     }
	 for(i=0;i<NUM;i++)
		outFile<<array[i]<<" ";
	 outFile.close();
		 
	 return;
}