1、冒泡排序 #include #define N 14 void bubble(int ,int); void print(int ,int);void main() int aN=28,48,18,7,76,25,78,4,19,54,11,34,89,5; print(a,N); bubble(a,N); void print(int a,int n) int i; for(i=0;iaj+1) t=aj;aj=aj+1;aj+1=t; print(a,N); 2、求最小值 #include void print(int ,int); void main() int a10=28,48,18,7,76,25,78,4,19,54; int i,min,mini; min=a0; mini=0; for(i=1;iai) min=ai; mini=i; print(a,10); printf(“nmin=%d mini=%dn“,min,mini); void print(int a,int n) int i; for(i=0;i #define N 14 void choice(int ,int); void print(int ,int); void main() int aN=28,48,18,7,76,25,78,4,19,54,11,34,89,5; int min,mini,i,j; print(a,N); choice(a,N); void print(int a,int n) int i; for(i=0;iaj) min=aj;mini=j; if(mini!=i) amini=ai;ai=min; print(a,N); 4、插入排序 #include void print(int ); void insert(int ,int); void main() int a20=14,28,48,18,7,76,25,78,4,19,54,11,34,89,5; int b20=0,i; print(a); for(i=1;i=i;j-) aj+1=aj; ai=key; a0+; void print(int a) int i; for(i=1;i void print(int ); void insert(int ,int); void main() int a11=10,4,7,9,17,27,36,40,50,54,65; int low,high,mid,flag=0,key; print(a); printf(“please input key:“); scanf(“%d“, low=1; high=a0; while(high=low) mid=(low+high)/2; if(key=amid) flag=1;break; else if(keyamid) low=mid+1; else high=mid-1; if(flag=1) printf(“%d exist array!n“,key); else printf(“%d not exist array!n“,key); void print(int a) int i; for(i=1;i=a0;i+) printf(“%5d“,ai); printf(“n“);