/5、编写一个程序,主函数中输入10个无序的整数,调用函数用冒泡法从大到小排序;主函数中再输入一个整数,调用函数用折半查找法找出该数,若存在,在主函数中输出其所处的位置,否则,插入适当位置。/
#include <stdio.h>
void input(int a[]){
int i=0;
for(i=0;i<10;i++)
scanf("%d",&a[i]);
}
void sort(int num[]){
int j,i,index,temp;
for (i=0; i<9; i++){
index=i;
for (j=i+1; j<10; j++)
if (num[j]>num[index])
index=j;
if (index!=i){temp=num[i];num[i]=num[index];num[index]=temp;}
}
for(i=0;i<10;i++) printf("%d ",num[i]);printf("\n");
}
int search(int num[],int ins){
int k=9,j=0,i;
i=(j+k)/2;
while(j<=k){
if(num[i]==ins)
return i;
if(num[i]<ins)
k=i-1;
else if(num[i]>ins)
j=i+1;
i=(j+k)/2;
}
return -1;
}
int main(){
int ss[10]={1,6,8,9,0,2,4,5,3,7};
sort(ss);
int n,m;
while(1){
scanf("%d",&n); m=search(ss,n);
if(m!=-1)
printf("you just found is di %d ge\n",m+1);
else
printf("these number is't found\n");
}
return 0;
}