用二分法查找数组中的数（适合学生，大佬勿喷，求放过）

l#include
using namespace std;

int main ()
{

int n,low=0,high=9,m,a[10]={0,1,2,3,4,5,6,7,8,9};
cin>>n;
 m=(low+high)/2;
while(a[m]!=n&&low<=high)
{

    if(a[m]<n)
    {
        low=m+1; m=(low+high)/2;
    }
    else
     high=m-1; m=(low+high)/2;

    }
    if(a[m]==n)
        cout<<"the location is "<<m+1<<endl;
    else
        return -1;
    }
    我觉得自己写的言简意赅，很是容易懂啊！