sort.cpp

算法分析和设计

#include "Sort.h"
#include <windows.h>  //DWORD,   GetTickCount()

void main()
{	
	Sort<int> s;
	int a[NUM],b[NUM],c[NUM],d[NUM],e[NUM];
	srand((unsigned)time(NULL));
	for(long i=0;i<NUM;i++)
	{
		a[i]=rand()*rand()/1000000;
		b[i]=c[i]=d[i]=e[i]=a[i];
	}


	cout<<"由于待排的数据量较大(100000),所用的时间较长，请耐心等待!!"<<endl;
	DWORD dwStart1 = GetTickCount();
	s.BubbleSort(a,NUM);
	DWORD dwEnd1 = GetTickCount();
	cout<<"所用时间是"<<dwEnd1-dwStart1<<"毫秒!"<<endl<<endl;

	DWORD dwStart2 = GetTickCount();
	s.HeapSort(b,NUM);
	DWORD dwEnd2 = GetTickCount();
	cout<<"所用时间是"<<dwEnd2-dwStart2<<"毫秒!"<<endl<<endl;

	DWORD dwStart3 = GetTickCount();
	s.InsertSort(c,NUM);
	DWORD dwEnd3 = GetTickCount();
	cout<<"所用时间是"<<dwEnd3-dwStart3<<"毫秒!"<<endl<<endl;

	DWORD dwStart4 = GetTickCount();
	s.MergeSort(d,NUM);
	DWORD dwEnd4 = GetTickCount();
	cout<<"归并排序所用时间是"<<dwEnd4-dwStart4<<"毫秒!"<<endl<<endl;

	DWORD dwStart5 = GetTickCount();
	s.QuickSort(e,0,NUM-1);
	DWORD dwEnd5 = GetTickCount();
	cout<<"所用时间是"<<dwEnd5-dwStart5<<"毫秒!"<<endl<<endl;

	cout<<"程序执行完毕!";
	char cs;
	cin>>cs;
}