void input(char a[]){
char *s;int k=0;
scanf("%s",s);
while(s){a[k++]=*s;s++;}
} //input
void sort(int a[],int n){ //n为数组元素个数
int i,j=n-1;
int flag=1,tp;
while(flag){
flag=0;i=0;
while(i<j){
if(a[i]>a[i+1]){tp=a[i]; a[i]=a[i+1];a[i+1]=tp; flag=1;}
}
--j;
}
}//Bubble_Sort
int search(int a[],int n,int key){//n是实际元素个数,应小于数组大小
int low=0,high=n-1;
int mid;
while(low<=high){
mid=(low+high)/2;
if(a[mid]==key) return mid;
else if(a[mid]>key) high=mid-1;
else low=mid+1;
}
for(int i=n-1;i>=low;--i) a[i+1]=a[i];
a[low]=key;
return -1; //所查关键字不在数组中
}
温馨提示:内容为网友见解,仅供参考