内部排序法

#include

#include

#include

#define N 100

int p,q;

//起泡排序

void gensort(int b[],int n)

{

int i,j;int s=0,t=0;

for(i=0;i

{

for(j=i+1;j

{

t++;

if(b[i]>b[j])

{

int temp=b[i];

b[i]=b[j];

b[j]=temp;

s+=3;

}}}

cout<<"移动次数="<

//插入排序

typedef int KeyType;

struct rec

{

KeyType key;

};

typedef rec sqlist[N];

void insertsort(sqlist b,int n)

{

int i,j;int s=0,t=0;

for(i=2;i

{

b[0]=b[i];

s++;

j=i-1;

t++;

while(b[0].key

{

b[j+1]=b[j];

j--;

s++;

t++;

}

b[j+1]=b[0];

s++;

}

cout<<"移动次数="<

//希尔排序

void shellsort(sqlist b,int n)

{

int i,j,gap;

rec x;

int s=0,t=0;

gap=n/2;

while(gap>0)

{

for(i=gap+1;i

{

j=i-gap;

while(j>0)

{

t++;

if(b[j].key>b[j+gap].key)

{

x=b[j];b[j]=b[j+gap];

b[j+gap]=x;j=j-gap;

s+=3;

}

else j=0;

gap=gap/2;

}}

cout<<"移动次数="<

//选择排序

void gentsort(int b[],int n)

{

int i,j,k;

for(i=0;i

{

k=i;

for(j=i+1;j

{

t++;

if(b[k]>b[j])

{k=j;}

}

if(k!=i)

{int temp=b[k];

b[k]=b[i];

b[i]=temp;

s+=3;

}}

cout<<"移动次数="<

//快速排序

void output(sqlist b,int n)//输出元素值

{

for(int i=0;i

cout<

cout<

}

void display(int n,int m)//输出计数

{

cout<<"移动次数="<

void BeforeSort()//初始化计数器

{

p=0;q=0;

}

void quicksort(sqlist r,int s,int t)

{

int i=s,j=t;

if(s

{

r[0]=r[s];p++;

while(i

{

while(i=r[0].key) j--;

r[i]=r[j];

q++;

p++;

p++;

while(i

i++;

r[j]=r[i];q++;p++;

}

r[i]=r[0];p++;

}

else return;

quicksort(r,s,j-1);

quicksort(r,j+1,t);

}

void sort(sqlist r,int s,int t)

{

BeforeSort();

quicksort(r,s,t);

display(p,q);

}

//堆排序

void sift(sqlist r,int s,int m)

{

int j;

rec x;

x=r[s];

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

{q++;

if(j

++j;

q++;

if(!(x.key

r[s]=r[j];s=j;p++;}

r[s]=x;p++;

}

void heapsort(sqlist &r,int m)

{

int i;rec w;

for(i=m/2;i>0;--i)

sift(r,i,m);

for(i=m;i>1;--i)

{

w=r[i];r[i]=r[1];

r[1]=w;

p+=3;

sift(r,1,i-1);

}

}

void sorting(sqlist &r,int t)

{

BeforeSort();

heapsort(r,t);

display(p,q);

}

/////////////////////////////////////////////////////////////////////////////// //主函数

void main()

{

int a1[N],i;

int e=N;

for(i=0;i

{a1[i]=e--;}

cout<<"排序前数组:\n";

for(i=0;i

cout<

cout<

sqlist a,b;

cout<<"起泡排序运行结果:\n";

gensort(a1,sizeof(a1)/sizeof(int));

cout<<"插入排序运行结果:\n";

e=N;

for(i=0;i

{

a[i].key=e--;

}

insertsort(a,N);

e=N;

for(i=0;i

{

b[i].key=e--;}

cout<<"希尔排序运行结果:\n";

shellsort(b,N);

cout<<"选择排序运行结果:\n";

e=N;

int c1[N];

for(i=0;i

c1[i]=e--;

gentsort(c1,N);

cout<<"快速排序运行结果:\n";

e=N;

sqlist c;

int low=0,high=10;

for(i=0;i

{

c[i].key=e--;

}

sort(c,low,high);

cout<<"堆排序运行结果:\n";

sqlist d;

e=N;

for(i=0;i

d[i].key=e--;

sorting(d,N);

cout<<"排序后数组:\n";

for(i=0;i

cout<

cout<

////////////////////////////////////////////////////////////////////// e=1;

for(i=0;i

{a1[i]=e++;}

cout<<"排序前数组:\n";

for(i=0;i

cout<

cout<

cout<<"起泡排序运行结果:\n";

gensort(a1,sizeof(a1)/sizeof(int));

cout<<"插入排序运行结果:\n";

e=1;

for(i=0;i

{a[i].key=e++;}

insertsort(a,N);

e=1;

for(i=0;i

{

b[i].key=e++;

}

cout<<"希尔排序运行结果:\n";

shellsort(b,N);

cout<<"选择排序运行结果:\n";

e=1;

for(i=0;i

c1[i]=e++;

gentsort(c1,N);

cout<<"快速排序运行结果:\n";

e=1;

for(i=0;i

{c[i].key=e++;}

sort(c,low,high);

cout<<"堆排序运行结果:\n";

e=1;

for(i=0;i

d[i].key=e++;

sorting(d,N);

cout<<"排序后数组:\n";

for(i=0;i

cout<

cout<

//////////////////////////////////////////////////////////////////////////////// for(i=0;i

{

a1[i]=rand()%100;

c1[i]=a1[i];

a[i].key=a1[i];

b[i].key=a1[i];

c[i].key=a1[i];

d[i].key=a1[i];

}

cout<<"排序前数组:\n";

for(i=0;i

cout<

cout<

cout<<"起泡排序运行结果:\n";

gensort(a1,sizeof(a1)/sizeof(int));

cout<<"插入排序运行结果:\n";

insertsort(a,N);

cout<<"希尔排序运行结果:\n";

shellsort(b,N);

cout<<"选择排序运行结果:\n"; gentsort(c1,N);

cout<<"快速排序运行结果:\n"; sort(c,low,high);

cout<<"堆排序运行结果:\n"; sorting(d,N);

cout<<"排序后数组:\n";

for(i=0;i

cout<

cout<

cin.get();

}