内部排序算法的性能分析源程序

附录内部排序算法的性能分析源程序#include

#include

#include

#include

#include

#define MAX 100 //long Max;

long dlta[10000];

int a[MAX+1];

int store[MAX+1];

long int com0=0,mov0=0;

long int com4=0,mov1=0;

long int com5=0,mov2=0;

double t0,t1,t2;

void randomizeNum(long n) //产生随机数，N代表产生随机数的个数

{

long i;

for(i=0;i

{

a[i]=rand()%1000;//控制生成的数据在之内

store[i]=a[i];

//printf("%5d",store[i]);

}

printf("\n");

}

void restore(long n)

{

long i;

for(i=0;i

a[i]=store[i];

//printf("%5d",store[i]);

}

//起泡排序法

void bubblesort(int r[],long n)

{

long i,j;

long w; //long int com0=0,mov0=0;

for(i=0;i<=n-1;i++)

for(j=n-1;j>=i+1;j--)

if(r[j]

{

w=r[j];

r[j]=r[j-1];

r[j-1]=w;

mov0=mov0+3;

}

com0++;

}

printf("起泡排序比较次数等于%ld,移动次数等于%ld\n",com0,mov0); }

//快速排序法

int Partition(int R[],int n, int low,int high)

{ int pivotkey;

pivotkey=R[low];

mov4++;

while(low

{

while( (low=pivotkey))

{ --high;

com4++;

}

R[low]=R[high];

mov4++;

while( (low

{

++low;

com4++;

}

R[high]=R[low];

mov4++;

}

R[low]=pivotkey;

mov4++;

return low;

}

void QSort(int R[],int n, int low,int high)

{ int pivotloc;

if (low

pivotloc=Partition(R,n,low,high);

QSort(R,n,low, pivotloc-1);

QSort(R,n, pivotloc+1,high);

}

}

void QuickSort(int R[],int n)

{

QSort(R,n,0,n-1);

printf("快速排序比较次数等于%ld,移动次数等于%ld\n",com1,mov1); }

//堆排序

void Sift(int R[], int s, int m)

{//筛选算法

int temp,j;

temp=R[s];mov5++;

for(j=2*s;j<=m;j*=2)

{

if ((j

{

j++;

com5++;

}

com5++;

if (temp>=R[j]) break;

R[s]=R[j];

mov5++;

s=j;

}

R[s]=temp;

mov5++;

}

void HeapSort(int R[],long n)

{ int i,temp;

for (i=n/2;i>=0;i--)//初始建堆

Sift(R,i,n);

for (i=n-1;i>=0;i--)

{

temp=R[0];

R[0]=R[i];

R[i]=temp;

mov4=mov5+3;

Sift(R,0,i-1);

}

printf("堆排序比较次数等于%ld,移动次数等于%ld\n",com2,mov2);

}

void print(int a,int num[]) //输出函数

{

int i;

int k=0;

printf("\n\n\n\t_______________________________________________________________________\n"); printf("\t|排序方法 |关键字比较次数 |关键字移动次数 |所需时间\n");

for(i=0;i

{

printf("\t\t ____________________________________________________________________ \n");

switch(num[i])

{

case 0 :printf("\t|起泡排序 %ld %ld %f|",com0,mov0,t0); break;

case 1 :printf("\t|快速排序 %ld %ld %f|",com1,mov1,t1); break;

case 2 :printf("\t|堆排序 %ld %ld %f|",com2,mov2,t2); break;

}

}

printf("\t\t______________________________________________________________________\n"); printf("\n\t\t※※※※※※※※※※※※※※※※※※※※\n");

printf("\t\t※※\n");

printf("\t\t※本组数据排序方法比较表※\n");

printf("\t\t※※\n");

printf("\t\t※※※※※※※※※※※※※※※※※※※※※\n");

}

void Enter_main() //友好界面函数

{

printf("\t\t\t 欢迎使用! ! !\n");

printf("\t\t\t***********************\n");

printf("\t\t\t O(∩_∩)O~ \n");

printf("\t\t\t! O(∩_∩)O~ \n");

printf("\t\t\t O(∩_∩)O~ \n");

printf("\t\t\t O(∩_∩)O~ \n");

printf("\t\t\t O(∩_∩)O~ \n");

printf("\t\t\t O(∩_∩)O~ \n");

printf("\t\t\t O(∩_∩)O~ \n");

printf("\t\t\t O(∩_∩)O~ \n");

printf("\t\t\t O(∩_∩)O~ \n");

printf("\t\t\t********************\n");

printf("请按任意键继续……");

}

void main()

{

int i,j,m;

char c='y';

int n=7;

int num[6];

clock_t start,end;

srand(time(NULL)); //计时函数

randomizeNum(MAX); //产生随机数函数

Enter_main();

getch();

printf("\n\n\n\n\t\t#############################################\n"); printf("\t\t 各种排序的实现与效率分析 \n");

printf("\t\t(1)对起泡排序、直接排序、简单选择排序、快速排\n");

printf("\t\t 序、堆排序算法进行比较\n");

printf("\t\t(2)数组中的数据是随机产生的,可用多组数据作 \n");

printf("\t\t 不同数据作比较，比较指标有：关键字参加比较\n");

printf("\t 次数和关键字的移动次数和每种算法所需要的时间;\n"); printf("\t\t(3)输出比较结果。 \n");

printf("\t\t#############################################\n");

printf("请按任意键继续……");

getch();

while(1)

{

i=0;

while(1)

{

while(1)

{

printf("\n\t\t请选择要排序的方法(0-2)\n");

printf("\t\t_________________\n");

printf("\t\t| 0.起泡排序 |\n");

printf("\t\t| 1.快速排序 |\n");

printf("\t\t| 2.堆排序 |\n");

printf("\t\t_________________\n");

printf("您的选择:");

printf("\n");

scanf("%d",&j);

while(1)

{

if(j>=0&&j<3)

break;

printf("你输入有误,请从新输入:");

scanf("%d",&j);

}

if (j!=n)

{

switch(j)

{

case 0 : { restore(MAX);

start=clock();

bubblesort(a,MAX);

end=clock();

t0=(double)(end-start)/CLOCKS_PER_SEC;

printf("起泡排序所需要的时间为：%f\n",t0); }break;

case 1 :{ restore(MAX);

start=clock();

QuickSort(a,MAX);

end=clock();

t1=(double)(end-start)/CLOCKS_PER_SEC;

printf("快速排序所需要的时间为：%f\n",t1);

}break;

case 2 :{restore(MAX);

start=clock();

HeapSort(a,MAX);

end=clock();

t2=(double)(end-start)/CLOCKS_PER_SEC;

printf("堆排序所需要的时间为：%f\n",t2);

}break;

}break;

}

else

{

printf("\n\t※※※※※※※※※※※※※※※※※※※※※※※※※※※※※※※※※\n"); printf("\t 注意!!!!!!!! \n"); printf("\t你选用的排序方法与你上次选用的排序方法相同,请重新选择其他的排序方法:\n"); printf("\t※※※※※※※※※※※※※※※※※※※※※※※※※※※※※※※※※\n"); printf("\n");

}

}

n=j;

num[i]=j;

i++;

getchar();

printf("\n\t\t※※※※※※※※※※※※※※※※※※※※\n");

printf("\t\t※请问还要继续用本组数据进行其他排序吗?(y/n)");

c=getchar();

if(c=='n'||c=='N')

{

n=7;

break;

}

printf("\t\t※※※※※※※※※※※※※※※※※※※※\n");

}

printf("\t\t※※※※※※※※※※※※※※※※※※※※\n");

printf("\n\t\t※※※※※※※※※※※※※※※※※※※※\n");

break;

}

print(i,num);

getchar();

getchar();

system("cls");

}