完全排序(2)

2020-05-30 16:55

int TempTime; int SpendTime; cout<

cout<<\插入排序:\

TempTime = (int)GetTickCount(); Insert( 1);

SpendTime = (int)GetTickCount() - TempTime; cout<

cout<<\\ LinkList();//随机数列复位 cout<

cout<<\希尔排序:\

TempTime = (int)GetTickCount(); ShellSort();

SpendTime = (int)GetTickCount() - TempTime; cout<

cout<<\\ LinkList(); //随机数列复位 cout<

cout<<\快速排序:\

TempTime = (int)GetTickCount(); QuickSort();

SpendTime = (int)GetTickCount() - TempTime; cout<

cout<<\\ LinkList(); //随机数列复位 cout<

cout<<\堆排序:\

TempTime = (int)GetTickCount(); HeapSort();

SpendTime = (int)GetTickCount() - TempTime; cout<

cout<<\\ LinkList(); //随机数列复位 cout<

cout<<\冒泡排序:\

TempTime = (int)GetTickCount(); BubbleSort();

SpendTime = (int)GetTickCount() - TempTime;

\

\

\

\

cout<

cout<<\\\ LinkList(); //随机数列复位 cout<

cout<<\选择排序:\

TempTime = (int)GetTickCount(); SelSort();

SpendTime = (int)GetTickCount() - TempTime; cout<

cout<<\\\}

void main(){ int i,j;

int select = 0;

int SpendTime = 0; int TempTime; do{ LinkList L; L.SelectSort(); cin>>select; switch (select) {

case 1:

cout<<\插入排序前:\ L.Display();

cout<<\插入排序后:\ TempTime = (int)GetTickCount(); L.Insert(1);

SpendTime = (int)GetTickCount() - TempTime; L.Display(); cout<

cout<<\比较次数=\\关键字移动次数=\\所需时间=\ break;

case 2: cout<<\希尔排序前:\ L.Display();

cout<<\希尔排序后:\ cout<

TempTime = (int)GetTickCount(); L.ShellSort();

SpendTime = (int)GetTickCount() - TempTime; L.Display(); cout<

cout<<\比较次数=\\关键字移动次数=\\所需时间=\ break; case 3: cout<<\快速排序前:\ L.Display();

cout<<\快速排序后:\ TempTime = (int)GetTickCount(); L.QuickSort();

SpendTime = (int)GetTickCount() - TempTime; L.Display(); cout<

cout<<\比较次数=\\关键字移动次数=\\所需时间=\ break; case 4: cout<<\堆排序前:\ L.Display(); cout<<\堆排序后:\

TempTime = (int)GetTickCount(); L.HeapSort();

SpendTime = (int)GetTickCount() - TempTime; L.Display(); cout<

cout<<\比较次数=\\关键字移动次数=\\所需时间=\ break; case 5:

cout<<\冒泡排序前:\ L.Display(); cout<<\冒泡排序后:\ TempTime = (int)GetTickCount(); L.BubbleSort();

SpendTime = (int)GetTickCount() - TempTime;

L.Display(); cout<

cout<<\比较次数=\\关键字移动次数=\\所需时间=\ break; case 6:

cout<<\选择排序前:\ L.Display(); cout<<\选择排序后:\ TempTime = (int)GetTickCount(); L.SelSort();

SpendTime = (int)GetTickCount() - TempTime; L.Display(); cout<

cout<<\比较次数=\\关键字移动次数=\\所需时间=\ break; case 7: L.AllAbove(); break; default: cout<<\ break; } } while(select!=8); }


完全排序(2).doc 将本文的Word文档下载到电脑 下载失败或者文档不完整,请联系客服人员解决!

下一篇:水泥包装纸项目可行性研究报告(发改立项备案+2013年最新案例范

相关阅读
本类排行
× 注册会员免费下载(下载后可以自由复制和排版)

马上注册会员

注:下载文档有可能“只有目录或者内容不全”等情况,请下载之前注意辨别,如果您已付费且无法下载或内容有问题,请联系我们协助你处理。
微信: QQ: