二分查找注意两点



#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
using namespace std;
#define N 10
bool bsearch(int a,int b[],int n) //形参为查找目标a，查找数组b[],数组范围，n
{
    int low=0,end=n-1;
    int mid=(low+end)/2;
    while(low<=end){   //注意就是这，之前以为二分查找简单没动手写，手残写成mid<=end导致出现死循环
        if(a<b[mid]){
            end=mid-1;   //记得在这里更新，end=mid-1,如果end=mid也会出错
            mid=(low+end)/2;
        }
        else if(a>b[mid]){
            low=mid+1;  //记得在这里更新，low=mid+1,如果low=mid也会出错
            mid=(low+end)/2;
        }
        else
            return true;
    }
    return false;
}
int main()
{
    int a[N];
    for(int i=0;i<N;i++)
        a[i]=i*i;
    int n;
    while(cin>>n){
        if(bsearch(n,a,N)){
            cout<<"found"<<endl;
        }
        else{
            cout<<"Not Found"<<endl;
        }
    }
}