实验实验实验.pdfVIP

Lab01_01 #include stdio.h #include stdlib.h typedef struct{ int num,l; }group; int cmp(const void* a,const void* b){ group *g1=(group*)a,*g2=(group*)b; int l=g1-l-g2-l; return l; } int main() { freopen(data10.in,r,stdin);//data1e2.indata1e3.in freopen(test10.out,w,stdout);//test1e2.outtest1e3.out int n,time=0; scanf(%d,n); group g[n]; for(int i=0;in;i++){ g[i].num=i+1; scanf(%d,g[i].l); } qsort(g,n,sizeof(group),cmp); for(int i=0;in;i++)time+=g[i].l*(n-i); printf(%d\n,time); for(int i=0;in;i++){ printf(%d,g[i].num); if(in- 1)printf( ); else printf(\n); } return 0; } Lab01_02 #include stdio.h #include stdlib.h #include time.h void insertsort(int *l,int n){//插入排序 int i,j,t; for(i= 1;in;i++){ t=l[i]; if(l[i]l[i-1]){ for(j=i- 1;tl[j]j=0;j--)l[j+1]=l[j]; l[j+ 1]=t; } } } void merge(int *l,int left,int right,int *m){//归并排序 if(left=right)return ; int mid=(left+right)/2,sign=left; merge(l,left,mid,m); merge(l,mid+1,right,m); int b1=left,e 1=mid,b2=mid+1,e2=right; while(b1=e1b2=e2){ if(l[b 1]l[b2])m[sign++]=l[b1++]; else m[sign++]=l[b2++]; } while(b1=e 1)m[sign++]=l[b1++]; while(b2=e2)m[sign++]=l[b2++]; for(int i=left;i=right;i++)l[i]=m[i]; } void mergesort(int *l,int n){ int* m= (int *)malloc(sizeof(int)*n); merge(l,0,n-1,m); free(m); } void quicksort(int* l,int left,int right){//快速排序 int i,j,sign=l[left]; i=left;j=right; if(ij)return ; while(i!=j){ while(l[j]=signji)j--; while(l[i]=signji)i++; if(ji){ int t=l[j]; l[j]=l[i]; l[i]=t; } } l[left]=l[i]; l[i]=sign; quicksort(l,left,i-1); quicksort(l,i+1,right); } int main() { double start,finish,elapsed; start=(double)clock()/CLOCKS_PER_SEC; freopen(data1m.txt,