多种排序耗时比较

#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#include<math.h>
#include<iostream>
using namespace std;
#define MAXSIZE 10000
#define OK 0
typedef int KeyType;
typedef int Status;
typedef struct{
    KeyType key;
}RedType;
typedef struct {
    RedType *r;
    int length;
}SqList;
Status InitSqList(SqList &L){//构造一个空的顺序表
    L.r=new RedType[MAXSIZE+1];
    L.length=0;
    return OK;
}
void Duqu(SqList &L){//读取文档“排序.txt”中的数字
    int i=1;
    FILE *fp;
    fp=fopen("排序.txt","rb");
    if(fp){
        while(fscanf(fp,"%d",&L.r[i].key)!=EOF)//文档中整数以空格或换行分隔开
            i++;
    }
    fclose(fp);
    printf("文档中共有%d个随机数\n",i-1);
    L.length=i-1;
}
Status Getr(SqList L,int n){//取值
    int i;
    //cout<<"请输入数字"<<endl;
    srand(time(0));
    cout<<"随机生成数字："<<endl;
    for(i=1;i<=n;i++)
        //cin>>L.r[i].key;
       L.r[i].key=rand();
    FILE *fp;
    fp=fopen("排序.txt","w");
    if(fp!=NULL){
    for(i=1;i<=n;i++)
        fprintf(fp,"%d\n",L.r[i].key);
       //cout<<L.r[i].key<<endl;
    }
    fclose(fp);
}
void InsertSort(SqList &L){//直接插入排序
    int i,j;
    for(i=2;i<=L.length;i++)
        if(L.r[i].key<L.r[i-1].key){
            L.r[0]=L.r[i];
            L.r[i]=L.r[i-1];
            for(j=i-2;L.r[0].key<L.r[j].key;j--)
                L.r[j+1]=L.r[j];
            L.r[j+1]=L.r[0];
        }
}
void BInsertSort(SqList &L){//折半插入排序
    int i,j,low,high,m;
    for(i=2;i<=L.length;i++){
        L.r[0]=L.r[i];
        low=1;high=i-1;
        while(low<=high){
            m=(low+high)/2;
            if(L.r[0].key<L.r[m].key)
                high=m-1;
            else low=m+1;
        }
        for(j=i-1;j>=high+1;j--){
            L.r[j+1]=L.r[j];
        }
        L.r[high+1]=L.r[0];
    }
}
void ShellInsert(SqList &L,int dk){//希尔排序
    int i,j;
    for(i=dk+1;i<=L.length;i++)
    if(L.r[i].key<L.r[i-dk].key){
        L.r[0]=L.r[i];
        for(j=i-dk;j>0&&L.r[0].key<L.r[j].key;j-=dk)
            L.r[j+dk]=L.r[j];
        L.r[j+dk]=L.r[0];
    }
}
void ShellSort(SqList &L,int t){//多趟希尔排序
    int k,dt[]={5,3,1};
    for(k=0;k<t;k++)
        ShellInsert(L,dt[k]);
}
void BubbleSort(SqList &L){//冒泡排序
    int m,flag,j,t;
    m=L.length-1;flag=1;
    while((m>0)&&(flag==1)){
        flag=0;
        for(j=1;j<=m;j++)
        if(L.r[j].key>L.r[j+1].key){
            flag=1;
            t=L.r[j].key;L.r[j].key=L.r[j+1].key;L.r[j+1].key=t;
        }
        m--;
    }
}
Status Partition(SqList &L,int low,int high){//快速排序
    int pivotkey;
    L.r[0]=L.r[low];
    pivotkey=L.r[low].key;
    while(low<high){
        while(low<high&&L.r[high].key>=pivotkey)
            high--;
        L.r[low]=L.r[high];
        while(low<high&&L.r[low].key<=pivotkey)
            low++;
        L.r[high].key=L.r[low].key;
    }
    L.r[low]=L.r[0];
    return low;
}
void QSort(SqList &L,int low,int high){
    int pivotloc;
  //  low=1;high=L.length;
    if(low<high){
        pivotloc=Partition(L,low,high);
        QSort(L,low,pivotloc-1);
        QSort(L,pivotloc+1,high);
    }
}
void QuickSort(SqList &L){
    QSort(L,1,L.length);
}
void SelectSort(SqList &L){//选择排序
    int i,j,k,t;
    for(i=1;i<L.length;i++){
        k=i;
        for(j=i+1;j<=L.length;j++)
            if(L.r[j].key<L.r[k].key)
                k=j;
        if(k!=i){
            t=L.r[i].key;
            L.r[i].key=L.r[k].key;
            L.r[k].key=t;
        }
    }
}

Status PrintSqList(SqList L){//输出排序结果
    int i;
    for(i=1;i<=L.length;i++){
        cout<<L.r[i].key<<endl;
    }
}

int main(){
    time_t t_start,t_end;
    SqList L;
    InitSqList(L);
    int c;
 /*   cout<<"请输入(随机生成)数字个数:"<<endl;
    cin>>n;
    Getr(L,n);
    L.length=n;*/

 /*   if(fp){
        while((s=fgetc(fp))!=EOF){
            if(s=='\n')
                n++;
            if(s)
        }
        printf("%d\n",n);
    }
    L.length=n;*/
/*    FILE *fp;
    fp=fopen("排序.txt","rb");
    if(fp){
        while(fscanf(fp,"%d",&L.r[i].key)!=EOF)//文档中整数以空格或换行分隔开
            i++;
    }
    fclose(fp);
    printf("文档中共有%d个随机数\n",i-1);
    L.length=i-1;*/
    cout<<"请选择：1.直接插入排序 2.折半插入排序 3.希尔排序 4.冒泡排序 5.快速排序 6.选择排序"<<endl;
    while(scanf("%d",&c)!=EOF){
    switch(c){
    case(1):
        Duqu(L);//读取文件“排序.txt”中的数据
        t_start=time(NULL);
        system("pause");
        InsertSort(L);
        cout<<"直接插入排序后的结果为："<<endl;
        PrintSqList(L);
        break;
    case(2):
        Duqu(L);
        t_start=time(NULL);
        system("pause");
        BInsertSort(L);
        cout<<"折半插入排序后的结果为："<<endl;
        PrintSqList(L);
        break;
    case(3):
        Duqu(L);
        t_start=time(NULL);
        system("pause");
        ShellSort(L,3);//进行3趟希尔排序
        cout<<"希尔排序后的结果为："<<endl;
        PrintSqList(L);
        break;
    case(4):
        Duqu(L);
        t_start=time(NULL);
        system("pause");
        BubbleSort(L);
        cout<<"冒泡排序后的结果为："<<endl;
        PrintSqList(L);
        break;
    case(5):
        Duqu(L);
        t_start=time(NULL);
        system("pause");
        QuickSort(L);
        cout<<"快速排序后的结果为："<<endl;
        PrintSqList(L);
        break;
    case(6):
        Duqu(L);
        t_start=time(NULL);
        system("pause");
        SelectSort(L);
        cout<<"选择排序后的结果为："<<endl;
        PrintSqList(L);
        break;
    }
    t_end=time(NULL);
    cout<<"The pause used "<<difftime(t_end,t_start)<<"s by clock()"<<endl;
    system("pause");
    }
return 0;
}