问题及代码:
/*
* Copyright (C) 2016, 烟台大学计算机与控制工程学院
* All rights reserved.
* 文件名称 : fagnzhou.cpp
* 作 者 : 吕方舟
* 完成日期 : 2016年9月9日
* 版 本 号 : v1.0
* 问题描述 :两种排序算法的运行时间
* 输入描述 :无
* 程序输出 :数字的顺序
*/
<p>选择排序程序:</p><pre class="cpp" name="code">#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#define MAXNUM 100000
void selectsort(int a[], int n)
{
int i, j, k, tmp;
for(i = 0; i < n-1; i++)
{
k = i;
for(j = i+1; j < n; j++)
{
if(a[j] < a[k])
k = j;
}
if(k != j)
{
tmp = a[i];
a[i] = a[k];
a[k] = tmp;
}
}
}
int main()
{
int x[MAXNUM];
int n = 0;
double t1,t2;
FILE *fp;
fp = fopen("numbers.txt", "r");
if(fp==NULL)
{
printf("打开文件错!请下载文件,并将之复制到与源程序文件同一文件夹下。\n");
exit(1);
}
while(fscanf(fp, "%d", &x[n])!=EOF)
n++;
printf("数据量:%d, 开始排序....", n);
t1=time(0);
selectsort(x, n);
t2=time(0);
printf("用时 %d 秒!", (int)(t2-t1));
fclose(fp);
return 0;
}
选择排序运行结果:
快速排序程序:
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#define MAXNUM 100000
void quicksort(int data[],int first,int last)
{
int i, j, t, base;
if (first>last)
return;
base=data[first];
i=first;
j=last;
while(i!=j)
{
while(data[j]>=base && i<j)
j--;
while(data[i]<=base && i<j)
i++;
/*交换两个数*/
if(i<j)
{
t=data[i];
data[i]=data[j];
data[j]=t;
}
}
data[first]=data[i];
data[i]=base;
quicksort(data,first,i-1);
quicksort(data,i+1,last);
}
int main()
{
int x[MAXNUM];
int n = 0;
double t1,t2;
FILE *fp;
fp = fopen("numbers.txt", "r");
if(fp==NULL)
{
printf("打开文件错!请下载文件,并将之复制到与源程序文件同一文件夹下。\n");
exit(1);
}
while(fscanf(fp, "%d", &x[n])!=EOF)
n++;
printf("数据量:%d, 开始排序....", n);
t1=time(0);
quicksort(x, 0, n-1);
t2=time(0);
printf("用时 %d 秒!", (int)(t2-t1));
fclose(fp);
return 0;
}
<p>快速排序运行结果:</p><p><img src="https://img-blog.csdn.net/20160909100604999" alt="" /></p><p>知识点总结:</p><p><span style="font-family:'microsoft yahei';font-size:14px;LINE-HEIGHT: 35px"> 用复杂度为<span id="MathJax-Span-10" class="mi">O</span><span id="MathJax-Span-11" class="mo">(</span><span id="MathJax-Span-12" class="mi">n</span><span id="MathJax-Span-13" class="mi">l</span><span id="MathJax-Span-14" class="mi">o</span><span id="MathJax-Span-15" class="mi">g<span></span></span><span id="MathJax-Span-16" class="mi">n</span><span id="MathJax-Span-17" class="mo">)的算法要比复杂度为<span style="BACKGROUND-COLOR: #f0f0f0"><span style="BORDER-BOTTOM: 0px; MIN-WIDTH: 0px; BORDER-LEFT: 0px; PADDING-BOTTOM: 0px; MARGIN: 0px; MIN-HEIGHT: 0px; PADDING-LEFT: 0px; PADDING-RIGHT: 0px; DISPLAY: inline; FONT-FAMILY: 'microsoft yahei'; DIRECTION: ltr; MAX-WIDTH: none; WORD-WRAP: normal; FLOAT: none; MAX-HEIGHT: none; FONT-SIZE: 14px; BORDER-TOP: 0px; BORDER-RIGHT: 0px; PADDING-TOP: 0px" id="MathJax-Element-1-Frame" class="MathJax"><nobr><span id="MathJax-Span-1" class="math"><span><span><span id="MathJax-Span-2" class="mrow"><span id="MathJax-Span-3" class="mi">O</span><span id="MathJax-Span-4" class="mo">(</span><span id="MathJax-Span-5" class="msubsup"><span><span><span id="MathJax-Span-6" class="mi">n</span><span></span></span><span><span id="MathJax-Span-7" class="mn">2</span><span></span></span></span></span></span><span></span></span></span></span></nobr></span><span style="font-family:'microsoft yahei';font-size:14px;LINE-HEIGHT: 35px">)的算法节约很多时间~ </span></span></span></span></p><p> </p><p>学习心得:</p><p> 好的算法可以有效节约更多的时间,通过练习要慢慢积累实际问题的经验~</p>