数据结构试验报告 - 各种内排序算法的实现及性能比较(3)

//this->childmenu();

cout<<\合并排序\

cout<<\直接用随机数据测试\ T *A;

double duration; clock_t start,finish; start=clock();

cout<<\

for(int i=0;i(3); MergeSort(A,SIZE); delete []A; }

finish=clock();

duration=(double)(finish-start)/CLOCKS_PER_SEC; //printout(A,SIZE);

cout<<\用时： \ system(\ //delete []A;

this->printmenu(); }/*ok*/

template

void Menu::quickSort() {

this->childmenu2(); T *A;

double duration; clock_t start,finish; if(c==1) { cout<<\原始快速排序\ cout<<\直接用随机数据测试\ start=clock(); cout<<\ for(int i=0;i(3); QuickSort2(A,SIZE); delete []A; } finish=clock(); duration=(double)(finish-start)/CLOCKS_PER_SEC;

cout<<\用时： \ system(\ }

else if(c==2) {

cout<<\改进的快速排序\ cout<<\直接用随机数据测试\ /*A=producedate(3); printout(A,SIZE); quick(A,SIZE); printout(A,SIZE); delete []A;

this->printmenu(); */

//T *A;

start=clock();

cout<<\

for(int i=0;i(3); quick(A,SIZE); delete []A; }

finish=clock();

duration=(double)(finish-start)/CLOCKS_PER_SEC;

cout<<\用时： \ system(\

this->quickSort(); }

else{cout<<\}

template

void Menu::selectsort() {

//this->childmenu();

cout<<\简单选择排序\

cout<<\直接用随机数据测试\ T *A;

double duration; clock_t start,finish; start=clock();

cout<<\

for(int i=0;i