二分查找

#include <stdio.h>
#include <stdlib.h>


int main()
{
    int a[10000],n,m,i,j,k,low,high,mid,flag;
    scanf("%d",&n);
    for(i=0; i<n; i++)
        scanf("%d",&a[i]);
    scanf("%d",&m);
    j=0;
    while(j<m)
    {
        low=0,high=n-1,flag=0;
        scanf("%d",&k);
        while(low<high&&flag==0)
        {
            if(high-low==1)
            {
                if(k==a[low])
                {
                    flag=1;
                }
                else if(k==a[high])
                {
                    flag=1;
                }
                else
                {
                    flag=2;
                }
            }
            else
            {
                mid=(high+low)/2;
                if(k==a[mid])
                {
                    flag=1;
                }
                else if(k<a[mid])
                {
                    high=mid;
                }
                else if(k>a[mid])
                {
                    low=mid;
                }
            }
        }
        if(flag==1)
            printf("Yes
");
        if(flag==2)
            printf("No
");
        j++;
    }
    return 0;
}