复习数据结构----二分查找算法

#include <iostream>
using namespace std;
int n;
int a[100000];
main()
{
    int k;
    int key;
    int low,high;
    while(cin>>n)
    {
        int i;
        k=-1;
        low=0;
        high=n-1;
        for(i=0;i<n;i++)
        {
            cin>>a[i];
        }
        cin>>key;
        while(low<=high)
        {
            int mid=(low+high)/2;
            if(a[mid]==key)
            {
                k=10000;
                break;
            }
            else if(a[mid]>key)
                high=mid-1;
            else
                low=mid+1;
        }
        if(k!=-1)
            cout<<"YES"<<endl;
        else
        cout<<"NO"<<endl;
    }
}
/*#include <iostream>
using namespace std;
int a[1000000];
void qsort(int l,int r)
{
    int x=a[l];
    int i=l;
    int j=r;
    if(l>=r) return;
    while(i<j)
    {
        while(i<j&&a[j]>=x)j--;
        a[i]=a[j];
        while(i<j&&a[i]<=x)i++;
        a[j]=a[i];
    }
    a[i]=x;
    qsort(l,i-1);
    qsort(i+1,r);
}

int main()
{
    int n;
    while(cin>>n)
    {
        for(int i=1;i<=n;i++)
        {
            cin>>a[i];
        }
        qsort(1,n);
        for(int i=n;i>0;i--)
        {
            if(i==n)
                cout<<a[i];
            else
                cout<<" "<<a[i];
        }
        cout<<endl;
    }
    return 0;
}*/