#define size 5 #include<iostream> using namespace std; int main() { int i,j; float t,a[size]; for (i=0;i<size;i++) //从键盘上为数组赋值 { cout<<"a["<<i<<"]="; cin>>a[i]; } for (i=0;i<size-1;i++) //使用冒泡排序法对数组按从小到大顺序排序 for (j=i+1;j<size;j++) if (a[i]>a[j]) { t=a[i]; a[i]=a[j]; a[j]=t; } for (i=0;i<size;i++) //显示排序结果 cout<<a[i]<<" "; cout<<endl; int value; int found; //找到为1,否则为0 int low,high,mid; for (i=1;i<=3;i++) { cout<<"value="; cin>>value; //输入要查找的数据 found=0; //二分法(又叫折半查找法)查找数组a low=0; high=size-1; while(low<=high) { mid=(high+low)/2; if (a[mid]==value) { found=1;