多种算法排序(国外英语资料).docVIP

多种算法排序(国外英语资料) # stdio.h in # stdlib.h in # time.h in # dos.h in # windows.h in # conio.h in # define maxsize 一个用作示例的小顺序表的最大长度 100 / * * / typedef struct { int r [maxsize + 1); / * r [0] 闲置或用作哨兵单元 * / int length; / * 顺序表长度, 除去哨兵的点 * / sqlist}; / * 顺序表类型 * / typedef sqlist heaptype; int time _ test [3], [5] = {{0,0,0,0,0}, {0,0,0,0,0}, {0,0,0,0,0}}; void heapsort (heaptype * h); void heapadjust (heaptype * h, int s, int m) void qsort (sqlist * l, int low, int high); int partition (sqlist * l, int low, int high); void bubblesort (sqlist * l, int k); void print (heaptype l); void role (sqlist * l); void show _ tim _ test (); void show _ menu (); int main () { heaptype l [5]; int i, totaltimecs, flag = 1, choose = - 1; char to _ array [maxsize]; large integer _ freq; large _ integer start, end; / * 用于每次排序的开始和结束的cup的时间 * / queryperformancefrequency ( freq); / * role the array * / / / randomize (); while (flag = = - 1) { for (i = 0; i 5; i + +) { printf (第% d组排序前: \ n, i + 1); vitamin (a l [i]); } printf (\ n数据产生显示完成, 按任意键继续!); getch (); system (cls); show _ menu (); in the { printf (please enter the choose (only 1 -- 5):); scanf (% s, choose _ array); choose = atoi (choose _ array); if (! (choose = = 1 | | choose = = 2 | | choose = = 3 | | choose = = 4 | | choose = = 5) printf (the error to choose again. ); } while (! (choose = = 1 | | choose = = 2 | | choose = = 3 | | choose = = 4 | | choose = = 5)); / * call the function insertsort that sort the numbers * / switch (choose) { case 1: for (i = 0; i 5; i + +) { queryperformancecounter ( start); heapsort (a l [i]); queryperformancecounter ( ); totaltimecs = (int) (end.quadpart-start.quadpart) * 1 / freq.quadpart); / / 将运行产生的时间乘以1000000, 便于显示、比较 tim _ test [0] [i] = totaltimecs; printf (\ n n第% d组 , i + 1); print (l [i]); printf (\ n此组数据排序运行时间为:% d, tim _ test [0] [i]); } printf (\ n按任意键产生新的数据, 进入下一组的排序算法的测试!); getch (); choose = - 1; system (cls); break; case 2: for (i = 0; i 5; i + +) { queryperformanceco