以下性序定折干查找 [ 填空 2 ] 应填 #include<stdio.h>int main(){ int a,b,mid,found=0,key; int x[10]=(1,3,6,7,10,16,35,41,43,56); scanf("%d",&key); a=0;b=9; do{ [ 填空 1 ] if(key==x[mid]) found=1; else if([ 填空 2 ]) b =mid-1; else [ 填空 3 ]: }while (!found && a<=b); if(found){ printf("%d in %dn",key,mid); } else printf("not found"); return 0;}A key < x [ mid ] B key > x [ mid ] C key = = x [ mid ] D Key = x [ mid ]
以下性序定折干查找 [ 填空 2 ] 应填
#include<stdio.h>
int main()
{
int a,b,mid,found=0,key;
int x[10]={1,3,6,7,10,16,35,41,43,56};
scanf("%d",&key);
a=0;b=9;
do{
[ 填空 1 ]
if(key==x[mid]) found=1;
else if([ 填空 2 ]) b =mid-1;
else [ 填空 3 ]:
}while (!found && a<=b);
if(found){
printf("%d in %d\n",key,mid);
}
else
printf("not found");
return 0;
}
A key < x [ mid ]
B key > x [ mid ]
C key = = x [ mid ]
D Key = x [ mid ]