数据结构—排序实验报告1

最新推荐文章于 2022-12-07 12:29:06 发布

涵~~

最新推荐文章于 2022-12-07 12:29:06 发布

阅读量416

点赞数

分类专栏：数据结构文章标签：数据结构算法

本文链接：https://blog.csdn.net/crhispretty/article/details/126988811

版权

数据结构专栏收录该内容

6 篇文章 1 订阅

订阅专栏

代码实现

#include<stdio.h>
#include<string.h>
#include<time.h>
#include<stdlib.h>
void sort1(int b[])//冒泡排序
{
    int i,j,t;
    FILE *fpWrite=fopen("E:\\shuju\\a\\sum.txt","w");
    for(i=0;i<10000;i++)
        for(j=0;j<10000;j++)
            {
                if(b[i]<b[j])
                {
                    t=b[i];
                    b[i]=b[j];
                    b[j]=t;
                }
            }

    for(i=0;i<10000;i++)
        fprintf(fpWrite,"%d ",b[i]);
   fprintf(fpWrite,"\n");

}
void sort2(int b[])//选择排序
{
    int i,j,m,t;
    FILE *fpWrite=fopen("C:\\Users\\lenovo\\Desktop\\1.txt","w");
    for(i=0;i<10000-1;i++)
    {
        for(j=i+1;j<10000;j++)
        {
            if(b[i]>b[j])
            {
                t=b[i];
                b[i]=b[j];
                b[j]=t;
            }
        }
    }
    for(i=0;i<10000;i++)
        fprintf(fpWrite,"%d ",b[i]);

}
int main()
{
    int i,v;
    int a[10005];
    clock_t start_time;
    clock_t finish_time;
    clock_t real_time;
    float current_time;
    float program_time;
    start_time=clock();

    FILE *fp;
    FILE *fpWrite;
    int *p=a;
    fp=fopen("C:\\Users\\lenovo\\Desktop\\10000.txt","r");
    if(fp==NULL)
    {
        printf("open file error\n");
        return -1;
    }
    i=0;
    while(i!=-1)
    {
        if(feof(fp))
            break;
        fscanf(fp,"%d",&p[i]);
        i++;
    }
    fclose(fp);
   // fpWrite=fopen("E:\\shuju\\a\\aum.txt","w");
    if(fpWrite==NULL)
    {
        return 1;
    }
    printf("please input 1 or 2,1-bubblesort 2-choicesort:");
    scanf("%d",&v);
    if(v==1){
    current_time=(float)start_time / CLOCKS_PER_SEC;
    printf("sort1 Program start time: %f\n",current_time);

    sort1(p);

    finish_time=clock();
    current_time=(float)finish_time / CLOCKS_PER_SEC;
    printf("sort1 Program finish time: %f\n",current_time);
    program_time=(float)(finish_time-start_time)/CLOCKS_PER_SEC;
    printf("sort1 Program complete time: %f\n",program_time);
    }
    else if(v==2){
    current_time=(float)start_time / CLOCKS_PER_SEC;
    printf("sort2 Program start time: %f\n",current_time);

    sort2(p);

    finish_time=clock();
    current_time=(float)finish_time / CLOCKS_PER_SEC;
    printf("sort2 Program finish time: %f\n",current_time);
    program_time=(float)(finish_time-start_time)/CLOCKS_PER_SEC;
    printf("sort2 Program complete time: %f\n",program_time);
    }
    return 0;
}