1001.二分查找
时限:1000ms 内存限制:10000K 总时限:3000ms
1 3 4 7 11
3
3
6
9
No
No
#include<stdio.h>
#include<stdlib.h>
void search(int a[],int n,int key)
{
int low=0;
int high=n-1;
int mid=(low+high)/2;
while(a[mid]!=key&&low<high)
{
if(a[mid]>key)
{
high=mid-1;
}
else if(a[mid]<key)
{
low=mid+1;
}
mid=(low+high)/2;
}
if(a[mid]==key)
printf("Yes\n");
else printf("No\n");
}
int main()
{
int i,n,num;
int a[100];
int b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&num);
for(i=0;i<num;i++)
{
scanf("%d",&b[i]);
search(a,n,b[i]);
}
return 0;
}