1242155103方实中.doc

#includemath.h #includestdio.h #includestring.h #define z 12 #define N 100 int charge[]={0,3,5,15,99,257,1200}; int bubch[10]={0},bubcm[10]={0}; int selch[10]={0},selcm[10]={0}; int insch[10]={0},inscm[10]={0}； int quich[10]={0},quicm[10]={0}; int shelch[10]={0},shelcm[10]={0}； int heach[10]={0},heacm[10]={0}; * copydata(int a[ ],int b[ ]) { int i; for(i=0;iN;i++) { b[i]=a[i]; } } void random(int a[ ],int n) { int i,t,t1,t2; for(i=0;in;i++) { t1=rand()%100; t2=rand()%100; t=a[t1]; a[t1]=a[t2]; a[t2]=t; } } void bub(int a[ ],int ck) { int i,j,t; for(i=0;iN-1;i++) for(j=0;jN-i-1;j++) { if(a[j]a[j+1]) {t=a[j+1]; a[j+1]=a[j]; a[j]=t; bubch[ck]+=3; } bubcm[ck]++; } } void select(int a[],int ck) { int i,j,min,t; for(i=0;iN-1;i++) { min=a[i]; for(j=i+1;jN;j++) { if(mina[j]) {t=min; min=a[j]; a[j]=t; selch[ck]+=3; } selcm[ck]++; } a[i]=min; } } void insertsort(int r[ ],int ck) { int i,j; for(i=2;i=N;i++) { r[0]=r[i]; j=i-1; insch[ck]++; while(r[0]r[j]) { r[j+1]=r[j]; j--; inscm[ck]++; insch[ck]++; } r[j+1]=r[0]; insch[ck]++; inscm[ck]++; } } void quicksort(int r[ ],int low,int high,int ck) { int p; if(lowhigh) { p=partition(r,low,high,ck); quicksort(r,p+1,high,ck); } quicm[ck]++; quich[ck]++; } int partition(int r[ ],int i,int j,int ck) { int p=r[0]; while(ij) { while(ijr[j]=p) { j--;quicm[ck]++;} if(ij) {r[i]=r[j]; quick[ck]++;} while(ijr[i]=p) {i++; quicm[ck]++; } if(ij) {r[j]=r[i]; quich[ck]++;} } r[i]=p; return i; } void shellsort(int r[ ],int n,int d[ ],int ck) { int i,j,k; int x; k=0; while(kz) { for(i=d[k]+1;in;i++) { x=r[i]; j=i-d[k]; shelcm[ck]++; while(j0)(xr[j])) { r[j+d[k]]=r[j]; j=j-d[k]; shelcm[ck]++; shelch[ck]++; } r[j+d[k]]=x; shelch[ck]++; } k++; } } void isift(int * p,int i,int n,int ck) { int j,t; t=p[i]; j=2*(i+1)-1;